Base | Representation |
---|---|
bin | 101110100111110110… |
… | …0001001010010000111 |
3 | 100120102121201222010220 |
4 | 1131033230021102013 |
5 | 3120022013021411 |
6 | 113554533115423 |
7 | 10143045221154 |
oct | 1351754112207 |
9 | 316377658126 |
10 | 100121220231 |
11 | 3950890070a |
12 | 174a2488b73 |
13 | 9597972ba6 |
14 | 4bbb1b722b |
15 | 290ebd1b06 |
hex | 174fb09487 |
100121220231 has 16 divisors (see below), whose sum is σ = 144014544864. Its totient is φ = 61635851264.
The previous prime is 100121220229. The next prime is 100121220247. The reversal of 100121220231 is 132022121001.
It is a cyclic number.
It is not a de Polignac number, because 100121220231 - 21 = 100121220229 is a prime.
It is a super-2 number, since 2×1001212202312 (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 100121220231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100121220131) 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 15 ways as a sum of consecutive naturals, for example, 18517686 + ... + 18523091.
It is an arithmetic number, because the mean of its divisors is an integer number (9000909054).
Almost surely, 2100121220231 is an apocalyptic number.
100121220231 is a deficient number, since it is larger than the sum of its proper divisors (43893324633).
100121220231 is a wasteful number, since it uses less digits than its factorization.
100121220231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37040850.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 100121220231 its reverse (132022121001), we get a palindrome (232143341232).
The spelling of 100121220231 in words is "one hundred billion, one hundred twenty-one million, two hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •