Base | Representation |
---|---|
bin | 1001001001111101001110… |
… | …11001001110001101000001 |
3 | 2122021201121200210111002112 |
4 | 10210332213121032031001 |
5 | 10114331014422420301 |
6 | 110453041455025105 |
7 | 4145404304252465 |
oct | 444764731161501 |
9 | 78251550714075 |
10 | 20133320123201 |
11 | 646254737593a |
12 | 2311b8020b195 |
13 | b30743c950bc |
14 | 4d865a6604a5 |
15 | 24daa94249bb |
hex | 124fa764e341 |
20133320123201 has 8 divisors (see below), whose sum is σ = 21008819617344. Its totient is φ = 19257832108240.
The previous prime is 20133320123197. The next prime is 20133320123209. The reversal of 20133320123201 is 10232102333102.
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 20133320123201 - 22 = 20133320123197 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20133320123209) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 814946 + ... + 6397716.
It is an arithmetic number, because the mean of its divisors is an integer number (2626102452168).
Almost surely, 220133320123201 is an apocalyptic number.
It is an amenable number.
20133320123201 is a deficient number, since it is larger than the sum of its proper divisors (875499494143).
20133320123201 is a wasteful number, since it uses less digits than its factorization.
20133320123201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5739591.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 20133320123201 its reverse (10232102333102), we get a palindrome (30365422456303).
The spelling of 20133320123201 in words is "twenty trillion, one hundred thirty-three billion, three hundred twenty million, one hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •