Base | Representation |
---|---|
bin | 11101011001010010110… |
… | …10011001010110101010 |
3 | 10120120000110221210200221 |
4 | 32230221122121112222 |
5 | 113022001044200020 |
6 | 2051554304320254 |
7 | 132654020124664 |
oct | 16545132312652 |
9 | 3516013853627 |
10 | 1010012100010 |
11 | 35a386554911 |
12 | 1438b701308a |
13 | 74322631684 |
14 | 36c56039534 |
15 | 1b4157146aa |
hex | eb296995aa |
1010012100010 has 16 divisors (see below), whose sum is σ = 1847825416872. Its totient is φ = 397381809600.
The previous prime is 1010012099977. The next prime is 1010012100017. The reversal of 1010012100010 is 100012100101.
It can be written as a sum of positive squares in 4 ways, for example, as 261643503121 + 748368596889 = 511511^2 + 865083^2 .
It is a super-2 number, since 2×10100121000102 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010012099966 and 1010012100002.
It is not an unprimeable number, because it can be changed into a prime (1010012100017) 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, 827878161 + ... + 827879380.
Almost surely, 21010012100010 is an apocalyptic number.
1010012100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1010012100010 is a deficient number, since it is larger than the sum of its proper divisors (837813316862).
1010012100010 is a wasteful number, since it uses less digits than its factorization.
1010012100010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1655757609.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1010012100010 its reverse (100012100101), we get a palindrome (1110024200111).
Subtracting from 1010012100010 its reverse (100012100101), we obtain a palindrome (909999999909).
The spelling of 1010012100010 in words is "one trillion, ten billion, twelve million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •