Base | Representation |
---|---|
bin | 101110101000001100… |
… | …1111000100001101111 |
3 | 100120110110022010022200 |
4 | 1131100121320201233 |
5 | 3120033100211343 |
6 | 114000042112543 |
7 | 10143252146334 |
oct | 1352031704157 |
9 | 316413263280 |
10 | 100133210223 |
11 | 3951464a9a2 |
12 | 174a64ab753 |
13 | 959a2b0467 |
14 | 4bbca1898b |
15 | 2910c9e4d3 |
hex | 175067886f |
100133210223 has 24 divisors (see below), whose sum is σ = 150016766016. Its totient is φ = 64308168000.
The previous prime is 100133210197. The next prime is 100133210237. The reversal of 100133210223 is 322012331001.
100133210223 is a `hidden beast` number, since 100 + 1 + 332 + 10 + 223 = 666.
It is not a de Polignac number, because 100133210223 - 210 = 100133209199 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100133210196 and 100133210205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100133210123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1454983 + ... + 1522248.
It is an arithmetic number, because the mean of its divisors is an integer number (6250698584).
Almost surely, 2100133210223 is an apocalyptic number.
100133210223 is a deficient number, since it is larger than the sum of its proper divisors (49883555793).
100133210223 is a wasteful number, since it uses less digits than its factorization.
100133210223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2977375 (or 2977372 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 100133210223 its reverse (322012331001), we get a palindrome (422145541224).
The spelling of 100133210223 in words is "one hundred billion, one hundred thirty-three million, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •