Base | Representation |
---|---|
bin | 11001000000101111010110… |
… | …110010100111101110110101 |
3 | 112102111002102021121202222210 |
4 | 121000233112302213232311 |
5 | 103404233104304341041 |
6 | 1025542120510444033 |
7 | 32112245244034422 |
oct | 3100572662475665 |
9 | 472432367552883 |
10 | 110002011012021 |
11 | 320606555192a7 |
12 | 10407162b03619 |
13 | 494c1b6b02bbb |
14 | 1d241a9064d49 |
15 | cab61104d016 |
hex | 640bd6ca7bb5 |
110002011012021 has 8 divisors (see below), whose sum is σ = 146669402795680. Its totient is φ = 73334646618192.
The previous prime is 110002011011969. The next prime is 110002011012079. The reversal of 110002011012021 is 120210110200011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110002011012021 - 218 = 110002010749877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110002011011988 and 110002011012006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110002011002021) 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, 5929410 + ... + 15973788.
It is an arithmetic number, because the mean of its divisors is an integer number (18333675349460).
Almost surely, 2110002011012021 is an apocalyptic number.
It is an amenable number.
110002011012021 is a deficient number, since it is larger than the sum of its proper divisors (36667391783659).
110002011012021 is a wasteful number, since it uses less digits than its factorization.
110002011012021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13694915.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110002011012021 its reverse (120210110200011), we get a palindrome (230212121212032).
The spelling of 110002011012021 in words is "one hundred ten trillion, two billion, eleven million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •