Base | Representation |
---|---|
bin | 101111001000111111… |
… | …0011100000100011111 |
3 | 100200022010100002022002 |
4 | 1132101332130010133 |
5 | 3124311211441111 |
6 | 114301141112515 |
7 | 10212440645255 |
oct | 1362176340437 |
9 | 320263302262 |
10 | 101233312031 |
11 | 39a29624745 |
12 | 177529b873b |
13 | 9714198587 |
14 | 4c84b825d5 |
15 | 297765563b |
hex | 1791f9c11f |
101233312031 has 4 divisors (see below), whose sum is σ = 101275795872. Its totient is φ = 101190828192.
The previous prime is 101233312013. The next prime is 101233312039. The reversal of 101233312031 is 130213332101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101233312031 - 222 = 101229117727 is a prime.
It is a super-2 number, since 2×1012333120312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101233311994 and 101233312012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101233312039) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21238346 + ... + 21243111.
It is an arithmetic number, because the mean of its divisors is an integer number (25318948968).
Almost surely, 2101233312031 is an apocalyptic number.
101233312031 is a deficient number, since it is larger than the sum of its proper divisors (42483841).
101233312031 is an equidigital number, since it uses as much as digits as its factorization.
101233312031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42483840.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 101233312031 its reverse (130213332101), we get a palindrome (231446644132).
The spelling of 101233312031 in words is "one hundred one billion, two hundred thirty-three million, three hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •