Base | Representation |
---|---|
bin | 101111110001100010001010… |
… | …111000111110110001010101 |
3 | 1000112221112010121211102020111 |
4 | 233301202022320332301111 |
5 | 210014434120330011201 |
6 | 2022512102524203021 |
7 | 62154046313631406 |
oct | 5761421270766125 |
9 | 1015845117742214 |
10 | 210112130313301 |
11 | 60a48065a4a387 |
12 | 1b69517b399471 |
13 | 90316480868c8 |
14 | 39c56a4c339ad |
15 | 194577312db51 |
hex | bf188ae3ec55 |
210112130313301 has 8 divisors (see below), whose sum is σ = 222701731179840. Its totient is φ = 197548092090048.
The previous prime is 210112130313289. The next prime is 210112130313307. The reversal of 210112130313301 is 103313031211012.
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 210112130313301 - 221 = 210112128216149 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 (210112130313307) 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, 6390643891 + ... + 6390676768.
It is an arithmetic number, because the mean of its divisors is an integer number (27837716397480).
Almost surely, 2210112130313301 is an apocalyptic number.
It is an amenable number.
210112130313301 is a deficient number, since it is larger than the sum of its proper divisors (12589600866539).
210112130313301 is a wasteful number, since it uses less digits than its factorization.
210112130313301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12781321643.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 210112130313301 its reverse (103313031211012), we get a palindrome (313425161524313).
The spelling of 210112130313301 in words is "two hundred ten trillion, one hundred twelve billion, one hundred thirty million, three hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •