Base | Representation |
---|---|
bin | 11100111111000001… |
… | …000110001010111101 |
3 | 2222022221120120201021 |
4 | 130333001012022331 |
5 | 1002214214214401 |
6 | 22144112544141 |
7 | 2151142555141 |
oct | 347701061275 |
9 | 88287516637 |
10 | 31122023101 |
11 | 12220630654 |
12 | 6046852051 |
13 | 2c1c986cb0 |
14 | 171347b221 |
15 | c223b02a1 |
hex | 73f0462bd |
31122023101 has 4 divisors (see below), whose sum is σ = 33516024892. Its totient is φ = 28728021312.
The previous prime is 31122023081. The next prime is 31122023159. The reversal of 31122023101 is 10132022113.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5594292025 + 25527731076 = 74795^2 + 159774^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31122023101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31122021101) 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 3 ways as a sum of consecutive naturals, for example, 1197000876 + ... + 1197000901.
It is an arithmetic number, because the mean of its divisors is an integer number (8379006223).
Almost surely, 231122023101 is an apocalyptic number.
It is an amenable number.
31122023101 is a deficient number, since it is larger than the sum of its proper divisors (2394001791).
31122023101 is a wasteful number, since it uses less digits than its factorization.
31122023101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2394001790.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 31122023101 its reverse (10132022113), we get a palindrome (41254045214).
The spelling of 31122023101 in words is "thirty-one billion, one hundred twenty-two million, twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •