Base | Representation |
---|---|
bin | 11101011001010001101… |
… | …00001111111110001110 |
3 | 10120112222210010202102021 |
4 | 32230220310033332032 |
5 | 113021441014200420 |
6 | 2051553310120354 |
7 | 132653536125523 |
oct | 16545064177616 |
9 | 3515883122367 |
10 | 1010002100110 |
11 | 35a380944833 |
12 | 1438b37b00ba |
13 | 7432053cb83 |
14 | 36c5499514a |
15 | 1b4148db7aa |
hex | eb28d0ff8e |
1010002100110 has 8 divisors (see below), whose sum is σ = 1818003780216. Its totient is φ = 404000840040.
The previous prime is 1010002100099. The next prime is 1010002100123. The reversal of 1010002100110 is 110012000101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10100021001102 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010002100093 and 1010002100102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50500104996 + ... + 50500105015.
It is an arithmetic number, because the mean of its divisors is an integer number (227250472527).
Almost surely, 21010002100110 is an apocalyptic number.
1010002100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1010002100110 is a deficient number, since it is larger than the sum of its proper divisors (808001680106).
1010002100110 is a wasteful number, since it uses less digits than its factorization.
1010002100110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101000210018.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1010002100110 its reverse (110012000101), we get a palindrome (1120014100211).
The spelling of 1010002100110 in words is "one trillion, ten billion, two million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •