Base | Representation |
---|---|
bin | 101111001000101011… |
… | …1001110010011011111 |
3 | 100200021101222210210100 |
4 | 1132101113032103133 |
5 | 3124301044011111 |
6 | 114300132512143 |
7 | 10212254401362 |
oct | 1362127162337 |
9 | 320241883710 |
10 | 101223032031 |
11 | 39a23843180 |
12 | 1774b47b653 |
13 | 9712009434 |
14 | 4c836680d9 |
15 | 29767c4756 |
hex | 17915ce4df |
101223032031 has 48 divisors (see below), whose sum is σ = 161013790080. Its totient is φ = 60767928000.
The previous prime is 101223031967. The next prime is 101223032063. The reversal of 101223032031 is 130230322101.
It is not a de Polignac number, because 101223032031 - 26 = 101223031967 is a prime.
It is a super-2 number, since 2×1012230320312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101223031995 and 101223032013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101223032431) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7398465 + ... + 7412133.
It is an arithmetic number, because the mean of its divisors is an integer number (3354453960).
Almost surely, 2101223032031 is an apocalyptic number.
101223032031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101223032031 is a deficient number, since it is larger than the sum of its proper divisors (59790758049).
101223032031 is a wasteful number, since it uses less digits than its factorization.
101223032031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14388 (or 14385 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 101223032031 its reverse (130230322101), we get a palindrome (231453354132).
The spelling of 101223032031 in words is "one hundred one billion, two hundred twenty-three million, thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •