Base | Representation |
---|---|
bin | 1001000110001001000100… |
… | …1101001001111101110101 |
3 | 1022102002122020201122211222 |
4 | 2101202101031021331311 |
5 | 2302324243210310401 |
6 | 33134241234440125 |
7 | 2051362035311003 |
oct | 221422115117565 |
9 | 38362566648758 |
10 | 10001120010101 |
11 | 32064a6576200 |
12 | 115634aa33045 |
13 | 5771421c40ac |
14 | 2680b1b99a73 |
15 | 12524342cc1b |
hex | 91891349f75 |
10001120010101 has 12 divisors (see below), whose sum is σ = 11470921696416. Its totient is φ = 8696626093320.
The previous prime is 10001120010041. The next prime is 10001120010107. The reversal of 10001120010101 is 10101002110001.
It is a happy number.
It is not a de Polignac number, because 10001120010101 - 226 = 10001052901237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001120010107) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1796820791 + ... + 1796826356.
It is an arithmetic number, because the mean of its divisors is an integer number (955910141368).
Almost surely, 210001120010101 is an apocalyptic number.
10001120010101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10001120010101 is a deficient number, since it is larger than the sum of its proper divisors (1469801686315).
10001120010101 is a wasteful number, since it uses less digits than its factorization.
10001120010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3593647192 (or 3593647181 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 10001120010101 its reverse (10101002110001), we get a palindrome (20102122120102).
The spelling of 10001120010101 in words is "ten trillion, one billion, one hundred twenty million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •