Base | Representation |
---|---|
bin | 1001001011111001111000… |
… | …1000101110010110000001 |
3 | 1022202120011210221012020000 |
4 | 2102332132020232112001 |
5 | 2310440022011400001 |
6 | 33251533121510213 |
7 | 2061465263452500 |
oct | 222763610562601 |
9 | 38676153835200 |
10 | 10100121200001 |
11 | 324448a120508 |
12 | 117157a1a2369 |
13 | 58358bac2131 |
14 | 26cbc42dc837 |
15 | 127ad9b1da86 |
hex | 92f9e22e581 |
10100121200001 has 30 divisors (see below), whose sum is σ = 17551155440610. Its totient is φ = 5771497826304.
The previous prime is 10100121199969. The next prime is 10100121200017. The reversal of 10100121200001 is 10000212100101.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 7632378680976 + 2467742519025 = 2762676^2 + 1570905^2 .
It is not a de Polignac number, because 10100121200001 - 25 = 10100121199969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10100121200501) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 1272372096 + ... + 1272380033.
It is an arithmetic number, because the mean of its divisors is an integer number (585038514687).
Almost surely, 210100121200001 is an apocalyptic number.
It is an amenable number.
10100121200001 is a deficient number, since it is larger than the sum of its proper divisors (7451034240609).
10100121200001 is an equidigital number, since it uses as much as digits as its factorization.
10100121200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2544752155 (or 2544752139 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10100121200001 its reverse (10000212100101), we get a palindrome (20100333300102).
The spelling of 10100121200001 in words is "ten trillion, one hundred billion, one hundred twenty-one million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •