Base | Representation |
---|---|
bin | 1001001011111001011101… |
… | …00010100111110100001001 |
3 | 2122112002202120100220212102 |
4 | 10211330232202213310021 |
5 | 10121424111034133001 |
6 | 110543431333523145 |
7 | 4153255062113351 |
oct | 445745642476411 |
9 | 78462676326772 |
10 | 20200012021001 |
11 | 648886019984a |
12 | 2322a931a34b5 |
13 | b36b11c51617 |
14 | 4db985b8bb61 |
15 | 2506ae3d1e6b |
hex | 125f2e8a7d09 |
20200012021001 has 8 divisors (see below), whose sum is σ = 20213672925600. Its totient is φ = 20186352581440.
The previous prime is 20200012020953. The next prime is 20200012021027. The reversal of 20200012021001 is 10012021000202.
It is a happy number.
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 20200012021001 - 222 = 20200007826697 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20200012021051) 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, 27957986 + ... + 28671396.
It is an arithmetic number, because the mean of its divisors is an integer number (2526709115700).
Almost surely, 220200012021001 is an apocalyptic number.
It is an amenable number.
20200012021001 is a deficient number, since it is larger than the sum of its proper divisors (13660904599).
20200012021001 is a wasteful number, since it uses less digits than its factorization.
20200012021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 732519.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 20200012021001 its reverse (10012021000202), we get a palindrome (30212033021203).
The spelling of 20200012021001 in words is "twenty trillion, two hundred billion, twelve million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •