Base | Representation |
---|---|
bin | 10000001010111001010… |
… | …010100000110000100101 |
3 | 10221020020011000221022002 |
4 | 100022321102200300211 |
5 | 121201224302400401 |
6 | 2210252151015045 |
7 | 143165552566451 |
oct | 20127122406045 |
9 | 3836204027262 |
10 | 1111210200101 |
11 | 399297209281 |
12 | 15b43a06a485 |
13 | 80a2c41b881 |
14 | 3bad6253661 |
15 | 1dd89c11a6b |
hex | 102b94a0c25 |
1111210200101 has 8 divisors (see below), whose sum is σ = 1114761512664. Its totient is φ = 1107659176960.
The previous prime is 1111210200029. The next prime is 1111210200131. The reversal of 1111210200101 is 1010020121111.
It can be written as a sum of positive squares in 4 ways, for example, as 336862999201 + 774347200900 = 580399^2 + 879970^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1111210200101 - 238 = 836332293157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111210200131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9732521 + ... + 9846033.
It is an arithmetic number, because the mean of its divisors is an integer number (139345189083).
Almost surely, 21111210200101 is an apocalyptic number.
It is an amenable number.
1111210200101 is a deficient number, since it is larger than the sum of its proper divisors (3551312563).
1111210200101 is a wasteful number, since it uses less digits than its factorization.
1111210200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144711.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1111210200101 its reverse (1010020121111), we get a palindrome (2121230321212).
The spelling of 1111210200101 in words is "one trillion, one hundred eleven billion, two hundred ten million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •