Base | Representation |
---|---|
bin | 1001000111001111110110… |
… | …1101001000010000001001 |
3 | 1022110220200101221022202102 |
4 | 2101303331231020100021 |
5 | 2303132201232401301 |
6 | 33151102450443145 |
7 | 2052633630255146 |
oct | 221637555102011 |
9 | 38426611838672 |
10 | 10020120200201 |
11 | 32135666a1251 |
12 | 1159b71b934b5 |
13 | 578b7c6ca227 |
14 | 268d953833cd |
15 | 1259a6503b6b |
hex | 91cfdb48409 |
10020120200201 has 8 divisors (see below), whose sum is σ = 10560532658400. Its totient is φ = 9481011513120.
The previous prime is 10020120200173. The next prime is 10020120200257. The reversal of 10020120200201 is 10200202102001.
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 10020120200201 - 26 = 10020120200137 is a prime.
It is a super-2 number, since 2×100201202002012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10020120200261) 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, 325926995 + ... + 325957736.
It is an arithmetic number, because the mean of its divisors is an integer number (1320066582300).
Almost surely, 210020120200201 is an apocalyptic number.
It is an amenable number.
10020120200201 is a deficient number, since it is larger than the sum of its proper divisors (540412458199).
10020120200201 is an equidigital number, since it uses as much as digits as its factorization.
10020120200201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 651885559.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 10020120200201 its reverse (10200202102001), we get a palindrome (20220322302202).
The spelling of 10020120200201 in words is "ten trillion, twenty billion, one hundred twenty million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •