Base | Representation |
---|---|
bin | 101111001000010101… |
… | …0001010100100000111 |
3 | 100200020120202201001021 |
4 | 1132100222022210013 |
5 | 3124240033021411 |
6 | 114255031412011 |
7 | 10212052114552 |
oct | 1362052124407 |
9 | 320216681037 |
10 | 101211220231 |
11 | 39a18105860 |
12 | 17747524007 |
13 | 970c731cc4 |
14 | 4c81c71699 |
15 | 297573ea71 |
hex | 1790a8a907 |
101211220231 has 8 divisors (see below), whose sum is σ = 110832061824. Its totient is φ = 91660348920.
The previous prime is 101211220223. The next prime is 101211220241. The reversal of 101211220231 is 132022112101.
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 101211220231 - 23 = 101211220223 is a prime.
It is a super-2 number, since 2×1012112202312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101211220241) 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, 17489541 + ... + 17495326.
It is an arithmetic number, because the mean of its divisors is an integer number (13854007728).
Almost surely, 2101211220231 is an apocalyptic number.
101211220231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101211220231 is a deficient number, since it is larger than the sum of its proper divisors (9620841593).
101211220231 is a wasteful number, since it uses less digits than its factorization.
101211220231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34985141.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 101211220231 its reverse (132022112101), we get a palindrome (233233332332).
The spelling of 101211220231 in words is "one hundred one billion, two hundred eleven million, two hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •