Base | Representation |
---|---|
bin | 101111110001101001101101… |
… | …000101001001101110010001 |
3 | 1000112222022000102020021111221 |
4 | 233301221231011021232101 |
5 | 210020102202322401001 |
6 | 2022515521353005041 |
7 | 62154453635106460 |
oct | 5761515505115621 |
9 | 1015868012207457 |
10 | 210120220122001 |
11 | 60a505374883a2 |
12 | 1b6968586b3781 |
13 | 90323370b2867 |
14 | 39c5c313d89d7 |
15 | 1945a984691a1 |
hex | bf1a6d149b91 |
210120220122001 has 8 divisors (see below), whose sum is σ = 254263123509120. Its totient is φ = 169508749005888.
The previous prime is 210120220121971. The next prime is 210120220122019. The reversal of 210120220122001 is 100221022021012.
It is a happy number.
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 210120220122001 - 219 = 210120219597713 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210120220122601) 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, 882858067621 + ... + 882858067858.
It is an arithmetic number, because the mean of its divisors is an integer number (31782890438640).
Almost surely, 2210120220122001 is an apocalyptic number.
It is an amenable number.
210120220122001 is a deficient number, since it is larger than the sum of its proper divisors (44142903387119).
210120220122001 is a wasteful number, since it uses less digits than its factorization.
210120220122001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1765716135503.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 210120220122001 its reverse (100221022021012), we get a palindrome (310341242143013).
The spelling of 210120220122001 in words is "two hundred ten trillion, one hundred twenty billion, two hundred twenty million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •