Base | Representation |
---|---|
bin | 1001001100011110110000… |
… | …1010000111101001000001 |
3 | 1022210111201200111121001012 |
4 | 2103013230022013221001 |
5 | 2311120310122420301 |
6 | 33300251254050305 |
7 | 2062265503066055 |
oct | 223075412075101 |
9 | 38714650447035 |
10 | 10110020123201 |
11 | 32486a9878a79 |
12 | 1173481349995 |
13 | 5844a887c93b |
14 | 26d482c6dc65 |
15 | 127eb8bb2ebb |
hex | 931ec287a41 |
10110020123201 has 8 divisors (see below), whose sum is σ = 10189797995520. Its totient is φ = 10030244929488.
The previous prime is 10110020123171. The next prime is 10110020123213. The reversal of 10110020123201 is 10232102001101.
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 10110020123201 - 242 = 5711973612097 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 (10110020183201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7279655 + ... + 8556483.
It is an arithmetic number, because the mean of its divisors is an integer number (1273724749440).
Almost surely, 210110020123201 is an apocalyptic number.
It is an amenable number.
10110020123201 is a deficient number, since it is larger than the sum of its proper divisors (79777872319).
10110020123201 is a wasteful number, since it uses less digits than its factorization.
10110020123201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1339303.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 10110020123201 its reverse (10232102001101), we get a palindrome (20342122124302).
The spelling of 10110020123201 in words is "ten trillion, one hundred ten billion, twenty million, one hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •