Base | Representation |
---|---|
bin | 10110110001001000001110… |
… | …100001111010011110000011 |
3 | 111010112122001200201201011001 |
4 | 112301020032201322132003 |
5 | 101111040102443411321 |
6 | 552544303304032431 |
7 | 30043243562461660 |
oct | 2661101641723603 |
9 | 433478050651131 |
10 | 100133111310211 |
11 | 299a6239962761 |
12 | b292574462717 |
13 | 43b46867a5825 |
14 | 1aa267b5baa67 |
15 | b89a5a862c91 |
hex | 5b120e87a783 |
100133111310211 has 8 divisors (see below), whose sum is σ = 120460885786880. Its totient is φ = 81311097905928.
The previous prime is 100133111310161. The next prime is 100133111310263. The reversal of 100133111310211 is 112013111331001.
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 100133111310211 - 241 = 97934088054659 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100133211310211) 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, 376440267951 + ... + 376440268216.
It is an arithmetic number, because the mean of its divisors is an integer number (15057610723360).
Almost surely, 2100133111310211 is an apocalyptic number.
100133111310211 is a deficient number, since it is larger than the sum of its proper divisors (20327774476669).
100133111310211 is an equidigital number, since it uses as much as digits as its factorization.
100133111310211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 752880536193.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 100133111310211 its reverse (112013111331001), we get a palindrome (212146222641212).
The spelling of 100133111310211 in words is "one hundred trillion, one hundred thirty-three billion, one hundred eleven million, three hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •