Base | Representation |
---|---|
bin | 10111000000101001110110… |
… | …000011010110111000100001 |
3 | 111021022121220000001122200221 |
4 | 113000221312003112320201 |
5 | 101231030100001120001 |
6 | 555122345503443041 |
7 | 30213313225050511 |
oct | 2700516603267041 |
9 | 437277800048627 |
10 | 101200000020001 |
11 | 2a2777518072a3 |
12 | b4252a32b6481 |
13 | 4461171739a8c |
14 | 1adc16b343841 |
15 | ba769e4b11a1 |
hex | 5c0a760d6e21 |
101200000020001 has 4 divisors (see below), whose sum is σ = 102586301390212. Its totient is φ = 99813698649792.
The previous prime is 101200000019891. The next prime is 101200000020029. The reversal of 101200000020001 is 100020000002101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 35748680160400 + 65451319859601 = 5979020^2 + 8090199^2 .
It is a cyclic number.
It is not a de Polignac number, because 101200000020001 - 27 = 101200000019873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101200000050001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 693150684996 + ... + 693150685141.
It is an arithmetic number, because the mean of its divisors is an integer number (25646575347553).
Almost surely, 2101200000020001 is an apocalyptic number.
It is an amenable number.
101200000020001 is a deficient number, since it is larger than the sum of its proper divisors (1386301370211).
101200000020001 is an equidigital number, since it uses as much as digits as its factorization.
101200000020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1386301370210.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 101200000020001 its reverse (100020000002101), we get a palindrome (201220000022102).
The spelling of 101200000020001 in words is "one hundred one trillion, two hundred billion, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •