Base | Representation |
---|---|
bin | 101101101100111100110010… |
… | …011001011011010111110110 |
3 | 222100200111202200101110111111 |
4 | 231230330302121123113312 |
5 | 202321200042110341042 |
6 | 1551254332134225234 |
7 | 60223562440113526 |
oct | 5554746231332766 |
9 | 870614680343444 |
10 | 201001020012022 |
11 | 5905506579038a |
12 | 1a663416ab521a |
13 | 8820412980619 |
14 | 378c703707686 |
15 | 183877013b517 |
hex | b6cf3265b5f6 |
201001020012022 has 4 divisors (see below), whose sum is σ = 301501530018036. Its totient is φ = 100500510006010.
The previous prime is 201001020011999. The next prime is 201001020012029. The reversal of 201001020012022 is 220210020100102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 201001020011993 and 201001020012011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201001020012029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50250255003004 + ... + 50250255003007.
It is an arithmetic number, because the mean of its divisors is an integer number (75375382504509).
Almost surely, 2201001020012022 is an apocalyptic number.
201001020012022 is a deficient number, since it is larger than the sum of its proper divisors (100500510006014).
201001020012022 is a wasteful number, since it uses less digits than its factorization.
201001020012022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100500510006013.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 201001020012022 its reverse (220210020100102), we get a palindrome (421211040112124).
The spelling of 201001020012022 in words is "two hundred one trillion, one billion, twenty million, twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •