Base | Representation |
---|---|
bin | 1001010010010111011000… |
… | …1011111011001010100001 |
3 | 1100011011200111221112210101 |
4 | 2110211312023323022201 |
5 | 2314244333221200001 |
6 | 33414531313302401 |
7 | 2102505034523032 |
oct | 224456613731241 |
9 | 40134614845711 |
10 | 10211120100001 |
11 | 328756a102a07 |
12 | 118ab97564a01 |
13 | 590b9b232612 |
14 | 274314024a89 |
15 | 12a93477ba01 |
hex | 949762fb2a1 |
10211120100001 has 8 divisors (see below), whose sum is σ = 10233431208000. Its totient is φ = 10188809690640.
The previous prime is 10211120099989. The next prime is 10211120100059. The reversal of 10211120100001 is 10000102111201.
10211120100001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10211120100001 - 25 = 10211120099969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10211120103001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38341900 + ... + 38607298.
It is an arithmetic number, because the mean of its divisors is an integer number (1279178901000).
Almost surely, 210211120100001 is an apocalyptic number.
It is an amenable number.
10211120100001 is a deficient number, since it is larger than the sum of its proper divisors (22311107999).
10211120100001 is an equidigital number, since it uses as much as digits as its factorization.
10211120100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 349319.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10211120100001 its reverse (10000102111201), we get a palindrome (20211222211202).
The spelling of 10211120100001 in words is "ten trillion, two hundred eleven billion, one hundred twenty million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •