Base | Representation |
---|---|
bin | 10110101111001100010001… |
… | …001000100001110010101001 |
3 | 111010001220111201000102211012 |
4 | 112233030101020201302221 |
5 | 101101400010304013001 |
6 | 552403212034313305 |
7 | 30030522331511156 |
oct | 2657142110416251 |
9 | 433056451012735 |
10 | 100000011001001 |
11 | 29954848240411 |
12 | b270809428835 |
13 | 43a4c644c8307 |
14 | 1a9a05247722d |
15 | b8636a7442bb |
hex | 5af311221ca9 |
100000011001001 has 8 divisors (see below), whose sum is σ = 102817039492608. Its totient is φ = 97200982692000.
The previous prime is 100000011000943. The next prime is 100000011001019. The reversal of 100000011001001 is 100100110000001.
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 100000011001001 - 222 = 100000006806697 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100000011031001) 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, 4500034385 + ... + 4500056606.
It is an arithmetic number, because the mean of its divisors is an integer number (12852129936576).
Almost surely, 2100000011001001 is an apocalyptic number.
It is an amenable number.
100000011001001 is a deficient number, since it is larger than the sum of its proper divisors (2817028491607).
100000011001001 is an equidigital number, since it uses as much as digits as its factorization.
100000011001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9000091303.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 100000011001001 its reverse (100100110000001), we get a palindrome (200100121001002).
It can be divided in two parts, 10000001 and 1001001, that multiplied together give a palindrome (10010011001001).
The spelling of 100000011001001 in words is "one hundred trillion, eleven million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •