Base | Representation |
---|---|
bin | 101101101101000111000001… |
… | …100100100111000110011010 |
3 | 222100201120010201210022220121 |
4 | 231231013001210213012122 |
5 | 202321340100034120442 |
6 | 1551303350555143454 |
7 | 60224432021462422 |
oct | 5555070144470632 |
9 | 870646121708817 |
10 | 201012012020122 |
11 | 5905979645a7a6 |
12 | 1a665584144b8a |
13 | 882147503a424 |
14 | 378d0674d7482 |
15 | 1838bb514c967 |
hex | b6d1c192719a |
201012012020122 has 16 divisors (see below), whose sum is σ = 311400574693632. Its totient is φ = 97215073976160.
The previous prime is 201012012020117. The next prime is 201012012020123. The reversal of 201012012020122 is 221020210210102.
It is a happy number.
It is a super-2 number, since 2×2010120120201222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201012012020096 and 201012012020105.
It is not an unprimeable number, because it can be changed into a prime (201012012020123) by changing a digit.
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, 813255568 + ... + 813502699.
It is an arithmetic number, because the mean of its divisors is an integer number (19462535918352).
Almost surely, 2201012012020122 is an apocalyptic number.
201012012020122 is a deficient number, since it is larger than the sum of its proper divisors (110388562673510).
201012012020122 is a wasteful number, since it uses less digits than its factorization.
201012012020122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1626760293.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201012012020122 its reverse (221020210210102), we get a palindrome (422032222230224).
The spelling of 201012012020122 in words is "two hundred one trillion, twelve billion, twelve million, twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •