Base | Representation |
---|---|
bin | 101111000010011001… |
… | …0010100101000001010 |
3 | 100122201200221220011202 |
4 | 1132010302110220022 |
5 | 3123333040011020 |
6 | 114223154224202 |
7 | 10204113051101 |
oct | 1360462245012 |
9 | 318650856152 |
10 | 101012032010 |
11 | 3992572779a |
12 | 176b0885062 |
13 | 96aa3a0356 |
14 | 4c63621038 |
15 | 2962ee5e75 |
hex | 1784c94a0a |
101012032010 has 16 divisors (see below), whose sum is σ = 183489748200. Its totient is φ = 40034126016.
The previous prime is 101012032007. The next prime is 101012032013. The reversal of 101012032010 is 10230210101.
It is an interprime number because it is at equal distance from previous prime (101012032007) and next prime (101012032013).
It can be written as a sum of positive squares in 4 ways, for example, as 100991119681 + 20912329 = 317791^2 + 4573^2 .
It is a super-2 number, since 2×1010120320102 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101012031982 and 101012032000.
It is not an unprimeable number, because it can be changed into a prime (101012032013) 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, 46334705 + ... + 46336884.
Almost surely, 2101012032010 is an apocalyptic number.
101012032010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101012032010 is a deficient number, since it is larger than the sum of its proper divisors (82477716190).
101012032010 is a wasteful number, since it uses less digits than its factorization.
101012032010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92671705.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 101012032010 its reverse (10230210101), we get a palindrome (111242242111).
The spelling of 101012032010 in words is "one hundred one billion, twelve million, thirty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •