Base | Representation |
---|---|
bin | 10110110000110011101001… |
… | …110110100010000111010101 |
3 | 111010110112001012010212201022 |
4 | 112300303221312202013111 |
5 | 101110204332401401010 |
6 | 552530211310410525 |
7 | 30041532300124625 |
oct | 2660635166420725 |
9 | 433415035125638 |
10 | 100111021122005 |
11 | 29997933597373 |
12 | b28a22a500a45 |
13 | 43b257606704a |
14 | 1aa1583880885 |
15 | b891b636bd55 |
hex | 5b0ce9da21d5 |
100111021122005 has 4 divisors (see below), whose sum is σ = 120133225346412. Its totient is φ = 80088816897600.
The previous prime is 100111021121981. The next prime is 100111021122043. The reversal of 100111021122005 is 500221120111001.
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 39100534253764 + 61010486868241 = 6253042^2 + 7810921^2 .
It is not a de Polignac number, because 100111021122005 - 236 = 100042301645269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10011102112196 + ... + 10011102112205.
It is an arithmetic number, because the mean of its divisors is an integer number (30033306336603).
Almost surely, 2100111021122005 is an apocalyptic number.
It is an amenable number.
100111021122005 is a deficient number, since it is larger than the sum of its proper divisors (20022204224407).
100111021122005 is an equidigital number, since it uses as much as digits as its factorization.
100111021122005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20022204224406.
The product of its (nonzero) digits is 40, while the sum is 17.
Adding to 100111021122005 its reverse (500221120111001), we get a palindrome (600332141233006).
The spelling of 100111021122005 in words is "one hundred trillion, one hundred eleven billion, twenty-one million, one hundred twenty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •