Base | Representation |
---|---|
bin | 1001001101000100110000… |
… | …0111111100110101110001 |
3 | 1022211111001112120012111210 |
4 | 2103101030013330311301 |
5 | 2311302202321231001 |
6 | 33305055343030333 |
7 | 2063106326346432 |
oct | 223211407746561 |
9 | 38744045505453 |
10 | 10120220102001 |
11 | 3251a63461019 |
12 | 117544929b3a9 |
13 | 585442b17859 |
14 | 26db6d7ab489 |
15 | 1283b43c3dd6 |
hex | 9344c1fcd71 |
10120220102001 has 8 divisors (see below), whose sum is σ = 13493642483584. Its totient is φ = 6746805560880.
The previous prime is 10120220101987. The next prime is 10120220102009. The reversal of 10120220102001 is 10020102202101.
10120220102001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10120220102001 - 217 = 10120219970929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10120220102009) 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, 2504280 + ... + 5148966.
It is an arithmetic number, because the mean of its divisors is an integer number (1686705310448).
Almost surely, 210120220102001 is an apocalyptic number.
It is an amenable number.
10120220102001 is a deficient number, since it is larger than the sum of its proper divisors (3373422381583).
10120220102001 is a wasteful number, since it uses less digits than its factorization.
10120220102001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3920231.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10120220102001 its reverse (10020102202101), we get a palindrome (20140322304102).
The spelling of 10120220102001 in words is "ten trillion, one hundred twenty billion, two hundred twenty million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •