Base | Representation |
---|---|
bin | 1011111101001… |
… | …11010101011001 |
3 | 20222201202220022 |
4 | 11332213111121 |
5 | 201134100441 |
6 | 13541440225 |
7 | 2325352115 |
oct | 576472531 |
9 | 228652808 |
10 | 100300121 |
11 | 51686a69 |
12 | 29710075 |
13 | 17a1a2ac |
14 | d46c745 |
15 | 8c1384b |
hex | 5fa7559 |
100300121 has 2 divisors, whose sum is σ = 100300122. Its totient is φ = 100300120.
The previous prime is 100300099. The next prime is 100300127. The reversal of 100300121 is 121003001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96746896 + 3553225 = 9836^2 + 1885^2 .
It is a cyclic number.
It is not a de Polignac number, because 100300121 - 210 = 100299097 is a prime.
It is a super-2 number, since 2×1003001212 = 20120228545229282, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100300099 and 100300108.
It is not a weakly prime, because it can be changed into another prime (100300127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50150060 + 50150061.
It is an arithmetic number, because the mean of its divisors is an integer number (50150061).
Almost surely, 2100300121 is an apocalyptic number.
It is an amenable number.
100300121 is a deficient number, since it is larger than the sum of its proper divisors (1).
100300121 is an equidigital number, since it uses as much as digits as its factorization.
100300121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 8.
The square root of 100300121 is about 10014.9948077870. The cubic root of 100300121 is about 464.6227656950.
Adding to 100300121 its reverse (121003001), we get a palindrome (221303122).
The spelling of 100300121 in words is "one hundred million, three hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •