Base | Representation |
---|---|
bin | 10110110000110011101000… |
… | …100110000000000011111001 |
3 | 111010110111222201102022212021 |
4 | 112300303220212000003321 |
5 | 101110204312000323001 |
6 | 552530205234114441 |
7 | 30041531622520540 |
oct | 2660635046000371 |
9 | 433414881368767 |
10 | 100111000011001 |
11 | 29997922688361 |
12 | b28a22341ba21 |
13 | 43b2571885025 |
14 | 1aa1580b47157 |
15 | b891b459bba1 |
hex | 5b0ce89800f9 |
100111000011001 has 8 divisors (see below), whose sum is σ = 120434285727680. Its totient is φ = 81293142865968.
The previous prime is 100111000010981. The next prime is 100111000011097. The reversal of 100111000011001 is 100110000111001.
It is a happy number.
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 100111000011001 - 239 = 99561244197113 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100111000011601) 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, 376357142766 + ... + 376357143031.
It is an arithmetic number, because the mean of its divisors is an integer number (15054285715960).
Almost surely, 2100111000011001 is an apocalyptic number.
It is an amenable number.
100111000011001 is a deficient number, since it is larger than the sum of its proper divisors (20323285716679).
100111000011001 is an equidigital number, since it uses as much as digits as its factorization.
100111000011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 752714285823.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100111000011001 its reverse (100110000111001), we get a palindrome (200221000122002).
The spelling of 100111000011001 in words is "one hundred trillion, one hundred eleven billion, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •