Base | Representation |
---|---|
bin | 101101101111110111111110… |
… | …011101011110101110100100 |
3 | 222101101201120011111120001122 |
4 | 231233313332131132232210 |
5 | 202332443210100401040 |
6 | 1551530532304513112 |
7 | 60244236265630520 |
oct | 5557677635365644 |
9 | 871351504446048 |
10 | 201202012122020 |
11 | 591223265764a8 |
12 | 1a69636a91b798 |
13 | 88363646a6620 |
14 | 379832d480d80 |
15 | 183dad57341b5 |
hex | b6fdfe75eba4 |
201202012122020 has 96 divisors (see below), whose sum is σ = 520044387475200. Its totient is φ = 63675336052224.
The previous prime is 201202012121993. The next prime is 201202012122037. The reversal of 201202012122020 is 20221210202102.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 201202012122020.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 64187591 + ... + 67249169.
It is an arithmetic number, because the mean of its divisors is an integer number (5417129036200).
Almost surely, 2201202012122020 is an apocalyptic number.
201202012122020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201202012122020 is an abundant number, since it is smaller than the sum of its proper divisors (318842375353180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201202012122020 is a wasteful number, since it uses less digits than its factorization.
201202012122020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3097717 (or 3097715 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 201202012122020 its reverse (20221210202102), we get a palindrome (221423222324122).
The spelling of 201202012122020 in words is "two hundred one trillion, two hundred two billion, twelve million, one hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •