Base | Representation |
---|---|
bin | 101110101000001000… |
… | …0001000111111101001 |
3 | 100120110021111100220110 |
4 | 1131100100020333221 |
5 | 3120031421444413 |
6 | 113555511244533 |
7 | 10143221351316 |
oct | 1352020107751 |
9 | 316407440813 |
10 | 100130656233 |
11 | 39513166063 |
12 | 174a5679749 |
13 | 95998c7b1a |
14 | 4bbc551d0d |
15 | 29109478c3 |
hex | 1750408fe9 |
100130656233 has 16 divisors (see below), whose sum is σ = 134170598016. Its totient is φ = 66423033600.
The previous prime is 100130656211. The next prime is 100130656303. The reversal of 100130656233 is 332656031001.
It is a happy number.
It is not a de Polignac number, because 100130656233 - 25 = 100130656201 is a prime.
It is a super-2 number, since 2×1001306562332 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100130656233.
It is not an unprimeable number, because it can be changed into a prime (100130656133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 410083 + ... + 606983.
It is an arithmetic number, because the mean of its divisors is an integer number (8385662376).
Almost surely, 2100130656233 is an apocalyptic number.
It is an amenable number.
100130656233 is a deficient number, since it is larger than the sum of its proper divisors (34039941783).
100130656233 is a wasteful number, since it uses less digits than its factorization.
100130656233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197744.
The product of its (nonzero) digits is 9720, while the sum is 30.
Adding to 100130656233 its reverse (332656031001), we get a palindrome (432786687234).
The spelling of 100130656233 in words is "one hundred billion, one hundred thirty million, six hundred fifty-six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •