Base | Representation |
---|---|
bin | 1100001110101110101… |
… | …0011110010001010001 |
3 | 202002100002012011210202 |
4 | 3003223222132101101 |
5 | 11420302211210001 |
6 | 240305121504545 |
7 | 21115530213551 |
oct | 3035352362121 |
9 | 662302164722 |
10 | 210112210001 |
11 | 81120957251 |
12 | 3487a1a2155 |
13 | 16a763368a5 |
14 | a2530d3161 |
15 | 56eb0e996b |
hex | 30eba9e451 |
210112210001 has 8 divisors (see below), whose sum is σ = 210445579584. Its totient is φ = 209778917040.
The previous prime is 210112209961. The next prime is 210112210003. The reversal of 210112210001 is 100012211012.
210112210001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 210112210001 - 234 = 192932340817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210112210003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8187971 + ... + 8213591.
It is an arithmetic number, because the mean of its divisors is an integer number (26305697448).
Almost surely, 2210112210001 is an apocalyptic number.
It is an amenable number.
210112210001 is a deficient number, since it is larger than the sum of its proper divisors (333369583).
210112210001 is a wasteful number, since it uses less digits than its factorization.
210112210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38311.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 210112210001 its reverse (100012211012), we get a palindrome (310124421013).
The spelling of 210112210001 in words is "two hundred ten billion, one hundred twelve million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •