Base | Representation |
---|---|
bin | 1001001001100101000110… |
… | …01100001110110110000001 |
3 | 2122020111011210220011101022 |
4 | 10210302203030032312001 |
5 | 10114123001331112301 |
6 | 110443100135315225 |
7 | 4144435252114403 |
oct | 444624314166601 |
9 | 78214153804338 |
10 | 20120364707201 |
11 | 6457aa9382070 |
12 | 230b56551bb15 |
13 | b2c45ac03585 |
14 | 4d7b8bbbcb73 |
15 | 24d59bd7cd1b |
hex | 124ca330ed81 |
20120364707201 has 8 divisors (see below), whose sum is σ = 22459941999264. Its totient is φ = 17865862953120.
The previous prime is 20120364707117. The next prime is 20120364707239. The reversal of 20120364707201 is 10270746302102.
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 20120364707201 - 226 = 20120297598337 is a prime.
It is a super-2 number, since 2×201203647072012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20120364307201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21268883996 + ... + 21268884941.
It is an arithmetic number, because the mean of its divisors is an integer number (2807492749908).
Almost surely, 220120364707201 is an apocalyptic number.
It is an amenable number.
20120364707201 is a deficient number, since it is larger than the sum of its proper divisors (2339577292063).
20120364707201 is a wasteful number, since it uses less digits than its factorization.
20120364707201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42537768991.
The product of its (nonzero) digits is 28224, while the sum is 35.
The spelling of 20120364707201 in words is "twenty trillion, one hundred twenty billion, three hundred sixty-four million, seven hundred seven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •