Base | Representation |
---|---|
bin | 101110110110100000… |
… | …0010000100011000101 |
3 | 100121200220011121020112 |
4 | 1131231000100203011 |
5 | 3122023414012013 |
6 | 114115422242405 |
7 | 10161166443125 |
oct | 1355500204305 |
9 | 317626147215 |
10 | 100613032133 |
11 | 39740485229 |
12 | 175bb126405 |
13 | 964581c053 |
14 | 4c2663ac85 |
15 | 293ce7dba8 |
hex | 176d0108c5 |
100613032133 has 8 divisors (see below), whose sum is σ = 100757254752. Its totient is φ = 100468856176.
The previous prime is 100613032087. The next prime is 100613032139. The reversal of 100613032133 is 331230316001.
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 100613032133 - 212 = 100613028037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100613032099 and 100613032108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100613032139) 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, 8304266 + ... + 8316372.
It is an arithmetic number, because the mean of its divisors is an integer number (12594656844).
Almost surely, 2100613032133 is an apocalyptic number.
It is an amenable number.
100613032133 is a deficient number, since it is larger than the sum of its proper divisors (144222619).
100613032133 is a wasteful number, since it uses less digits than its factorization.
100613032133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23331.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 100613032133 its reverse (331230316001), we get a palindrome (431843348134).
The spelling of 100613032133 in words is "one hundred billion, six hundred thirteen million, thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •