Base | Representation |
---|---|
bin | 1001001100011110101011… |
… | …1101110001111001100001 |
3 | 1022210111200021211212202000 |
4 | 2103013222331301321201 |
5 | 2311120240012024301 |
6 | 33300245301114213 |
7 | 2062265141020044 |
oct | 223075275617141 |
9 | 38714607755660 |
10 | 10110000111201 |
11 | 324869954a731 |
12 | 11734766b8969 |
13 | 5844a4693c13 |
14 | 26d480340c5b |
15 | 127eb705d786 |
hex | 931eaf71e61 |
10110000111201 has 32 divisors (see below), whose sum is σ = 15228477815040. Its totient is φ = 6627260073600.
The previous prime is 10110000111199. The next prime is 10110000111203. The reversal of 10110000111201 is 10211100001101.
It is an interprime number because it is at equal distance from previous prime (10110000111199) and next prime (10110000111203).
It is not a de Polignac number, because 10110000111201 - 21 = 10110000111199 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10110000111203) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3824236 + ... + 5902946.
It is an arithmetic number, because the mean of its divisors is an integer number (475889931720).
Almost surely, 210110000111201 is an apocalyptic number.
It is an amenable number.
10110000111201 is a deficient number, since it is larger than the sum of its proper divisors (5118477703839).
10110000111201 is a wasteful number, since it uses less digits than its factorization.
10110000111201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2081734 (or 2081728 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10110000111201 its reverse (10211100001101), we get a palindrome (20321100112302).
The spelling of 10110000111201 in words is "ten trillion, one hundred ten billion, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •