Base | Representation |
---|---|
bin | 10110110000101011010111… |
… | …111010000110010010100101 |
3 | 111010102200002120011210111010 |
4 | 112300223113322012102211 |
5 | 101110033130303212013 |
6 | 552522141141532433 |
7 | 30041066050013433 |
oct | 2660532772062245 |
9 | 433380076153433 |
10 | 100102130132133 |
11 | 29994090891058 |
12 | b288568a14119 |
13 | 43b178a0636ac |
14 | 1aa0d7cb23d53 |
15 | b88d45a247c3 |
hex | 5b0ad7e864a5 |
100102130132133 has 8 divisors (see below), whose sum is σ = 133573861427200. Its totient is φ = 66682576129248.
The previous prime is 100102130132107. The next prime is 100102130132149. The reversal of 100102130132133 is 331231031201001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100102130132133 - 25 = 100102130132101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100102130132933) 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, 13044318568 + ... + 13044326241.
It is an arithmetic number, because the mean of its divisors is an integer number (16696732678400).
Almost surely, 2100102130132133 is an apocalyptic number.
It is an amenable number.
100102130132133 is a deficient number, since it is larger than the sum of its proper divisors (33471731295067).
100102130132133 is a wasteful number, since it uses less digits than its factorization.
100102130132133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26088646091.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 100102130132133 its reverse (331231031201001), we get a palindrome (431333161333134).
The spelling of 100102130132133 in words is "one hundred trillion, one hundred two billion, one hundred thirty million, one hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •