Base | Representation |
---|---|
bin | 101111000101010101… |
… | …1111011101011000111 |
3 | 100122222121020000111011 |
4 | 1132022223323223013 |
5 | 3124033410121411 |
6 | 114241052023051 |
7 | 10206424330354 |
oct | 1361253735307 |
9 | 318877200434 |
10 | 101111020231 |
11 | 39976598041 |
12 | 17719a61a87 |
13 | 96c4a4b470 |
14 | 4c7282b62b |
15 | 296ba4ac21 |
hex | 178aafbac7 |
101111020231 has 16 divisors (see below), whose sum is σ = 110501707680. Its totient is φ = 91958169600.
The previous prime is 101111020223. The next prime is 101111020243. The reversal of 101111020231 is 132020111101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 101111020231 - 23 = 101111020223 is a prime.
It is a super-2 number, since 2×1011110202312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101111020211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 173031 + ... + 481831.
It is an arithmetic number, because the mean of its divisors is an integer number (6906356730).
Almost surely, 2101111020231 is an apocalyptic number.
101111020231 is a deficient number, since it is larger than the sum of its proper divisors (9390687449).
101111020231 is a wasteful number, since it uses less digits than its factorization.
101111020231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309186.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 101111020231 its reverse (132020111101), we get a palindrome (233131131332).
The spelling of 101111020231 in words is "one hundred one billion, one hundred eleven million, twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •