Base | Representation |
---|---|
bin | 10110111101111010111100… |
… | …111010000101010011010001 |
3 | 111020122200011121101220000210 |
4 | 112331322330322011103101 |
5 | 101214441001303210001 |
6 | 554500211352234333 |
7 | 30163614510025206 |
oct | 2675727472052321 |
9 | 436580147356023 |
10 | 101012210210001 |
11 | 2a20504630a612 |
12 | b3b4a1499b9a9 |
13 | 4449544c968cc |
14 | 1ad3034b55cad |
15 | ba285ce7add6 |
hex | 5bdebce854d1 |
101012210210001 has 8 divisors (see below), whose sum is σ = 139027558138624. Its totient is φ = 65169167877360.
The previous prime is 101012210209997. The next prime is 101012210210003. The reversal of 101012210210001 is 100012012210101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101012210210001 - 22 = 101012210209997 is a prime.
It is a super-2 number, since 2×1010122102100012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101012210210003) 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, 543076398886 + ... + 543076399071.
It is an arithmetic number, because the mean of its divisors is an integer number (17378444767328).
Almost surely, 2101012210210001 is an apocalyptic number.
It is an amenable number.
101012210210001 is a deficient number, since it is larger than the sum of its proper divisors (38015347928623).
101012210210001 is a wasteful number, since it uses less digits than its factorization.
101012210210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1086152797991.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101012210210001 its reverse (100012012210101), we get a palindrome (201024222420102).
The spelling of 101012210210001 in words is "one hundred one trillion, twelve billion, two hundred ten million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •