Base | Representation |
---|---|
bin | 11100111110111001… |
… | …011010111100001111 |
3 | 2222022210210100122212 |
4 | 130332321122330033 |
5 | 1002213210323043 |
6 | 22144001501035 |
7 | 2151116505053 |
oct | 347671327417 |
9 | 88283710585 |
10 | 31120011023 |
11 | 1221a486982 |
12 | 604604177b |
13 | 2c1c43120a |
14 | 17130b5c63 |
15 | c22114018 |
hex | 73ee5af0f |
31120011023 has 8 divisors (see below), whose sum is σ = 33643255920. Its totient is φ = 28685301120.
The previous prime is 31120011001. The next prime is 31120011029. The reversal of 31120011023 is 32011002113.
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 31120011023 - 26 = 31120010959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31120010989 and 31120011007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31120011029) 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 7 ways as a sum of consecutive naturals, for example, 22133018 + ... + 22134423.
It is an arithmetic number, because the mean of its divisors is an integer number (4205406990).
Almost surely, 231120011023 is an apocalyptic number.
31120011023 is a deficient number, since it is larger than the sum of its proper divisors (2523244897).
31120011023 is a wasteful number, since it uses less digits than its factorization.
31120011023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44267497.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 31120011023 its reverse (32011002113), we get a palindrome (63131013136).
It can be divided in two parts, 311200 and 11023, that added together give a palindrome (322223).
The spelling of 31120011023 in words is "thirty-one billion, one hundred twenty million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •