Base | Representation |
---|---|
bin | 1001010001110001101011… |
… | …1111010000111011000001 |
3 | 1100010012120020102022001022 |
4 | 2110130122333100323001 |
5 | 2314113122012320001 |
6 | 33410135203115225 |
7 | 2101666202232125 |
oct | 224343277207301 |
9 | 40105506368038 |
10 | 10201000120001 |
11 | 32832466a0179 |
12 | 1189032372b15 |
13 | 58cc47727382 |
14 | 273a33d8d585 |
15 | 12a5410be11b |
hex | 9471afd0ec1 |
10201000120001 has 8 divisors (see below), whose sum is σ = 10224410119680. Its totient is φ = 10177591846032.
The previous prime is 10201000119997. The next prime is 10201000120009. The reversal of 10201000120001 is 10002100010201.
10201000120001 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 10201000120001 - 22 = 10201000119997 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 (10201000120009) 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, 11801855 + ... + 12636683.
It is an arithmetic number, because the mean of its divisors is an integer number (1278051264960).
Almost surely, 210201000120001 is an apocalyptic number.
It is an amenable number.
10201000120001 is a deficient number, since it is larger than the sum of its proper divisors (23409999679).
10201000120001 is an equidigital number, since it uses as much as digits as its factorization.
10201000120001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 862855.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 10201000120001 its reverse (10002100010201), we get a palindrome (20203100130202).
The spelling of 10201000120001 in words is "ten trillion, two hundred one billion, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •