Base | Representation |
---|---|
bin | 1001001101000100010110… |
… | …1011100101010010011001 |
3 | 1022211110210000011011110111 |
4 | 2103101011223211102121 |
5 | 2311301442133032301 |
6 | 33305040522044321 |
7 | 2063103544460605 |
oct | 223210553452231 |
9 | 38743700134414 |
10 | 10120112002201 |
11 | 3251a08438043 |
12 | 11754190496a1 |
13 | 5854265c9386 |
14 | 26db5d2ac505 |
15 | 1283a9b6e551 |
hex | 93445ae5499 |
10120112002201 has 4 divisors (see below), whose sum is σ = 10193981433012. Its totient is φ = 10046242571392.
The previous prime is 10120112002183. The next prime is 10120112002207. The reversal of 10120112002201 is 10220021102101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6740379058176 + 3379732944025 = 2596224^2 + 1838405^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120112002201 - 29 = 10120112001689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10120112002207) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36934715200 + ... + 36934715473.
It is an arithmetic number, because the mean of its divisors is an integer number (2548495358253).
Almost surely, 210120112002201 is an apocalyptic number.
It is an amenable number.
10120112002201 is a deficient number, since it is larger than the sum of its proper divisors (73869430811).
10120112002201 is an equidigital number, since it uses as much as digits as its factorization.
10120112002201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73869430810.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10120112002201 its reverse (10220021102101), we get a palindrome (20340133104302).
The spelling of 10120112002201 in words is "ten trillion, one hundred twenty billion, one hundred twelve million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •