Base | Representation |
---|---|
bin | 101101110000001001101010… |
… | …010110111101101000101000 |
3 | 222101110112120121201121002101 |
4 | 231300021222112331220220 |
5 | 202333301103032101440 |
6 | 1551543352520343144 |
7 | 60245511006052036 |
oct | 5560115226755050 |
9 | 871415517647071 |
10 | 201221002222120 |
11 | 5912a390a2a801 |
12 | 1a699b8a614ab4 |
13 | 883809ca88c4a |
14 | 379921159d556 |
15 | 183e3479b569a |
hex | b7026a5bda28 |
201221002222120 has 32 divisors (see below), whose sum is σ = 452772227524320. Its totient is φ = 80483961328960.
The previous prime is 201221002222091. The next prime is 201221002222139. The reversal of 201221002222120 is 21222200122102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 138001942 + ... + 139452421.
It is an arithmetic number, because the mean of its divisors is an integer number (14149132110135).
Almost surely, 2201221002222120 is an apocalyptic number.
201221002222120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201221002222120 is an abundant number, since it is smaller than the sum of its proper divisors (251551225302200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201221002222120 is a wasteful number, since it uses less digits than its factorization.
201221002222120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277472505 (or 277472501 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 201221002222120 its reverse (21222200122102), we get a palindrome (222443202344222).
The spelling of 201221002222120 in words is "two hundred one trillion, two hundred twenty-one billion, two million, two hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •