Base | Representation |
---|---|
bin | 101111110001100010001111… |
… | …110001011100000000111101 |
3 | 1000112221112100022221210212111 |
4 | 233301202033301130000331 |
5 | 210014434302312101023 |
6 | 2022512115011534021 |
7 | 62154051330064333 |
oct | 5761421761340075 |
9 | 1015845308853774 |
10 | 210112212222013 |
11 | 60a480a8204632 |
12 | 1b6951a28ba311 |
13 | 903165c0349ba |
14 | 39c56b1a75b53 |
15 | 194577a40d00d |
hex | bf188fc5c03d |
210112212222013 has 8 divisors (see below), whose sum is σ = 215132331572928. Its totient is φ = 205098174181824.
The previous prime is 210112212221963. The next prime is 210112212222047. The reversal of 210112212222013 is 310222212211012.
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 210112212222013 - 217 = 210112212090941 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210112212222083) 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, 1520257756 + ... + 1520395957.
It is an arithmetic number, because the mean of its divisors is an integer number (26891541446616).
Almost surely, 2210112212222013 is an apocalyptic number.
It is an amenable number.
210112212222013 is a deficient number, since it is larger than the sum of its proper divisors (5020119350915).
210112212222013 is a wasteful number, since it uses less digits than its factorization.
210112212222013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3040655363.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 210112212222013 its reverse (310222212211012), we get a palindrome (520334424433025).
The spelling of 210112212222013 in words is "two hundred ten trillion, one hundred twelve billion, two hundred twelve million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •