Base | Representation |
---|---|
bin | 11100111000100001… |
… | …111110100001100111 |
3 | 2222001100210220020222 |
4 | 130320201332201213 |
5 | 1002003334431043 |
6 | 22125224314555 |
7 | 2145351603416 |
oct | 347041764147 |
9 | 88040726228 |
10 | 31013202023 |
11 | 12175164781 |
12 | 6016312a5b |
13 | 2c0327541b |
14 | 1702c3147d |
15 | c17a66d68 |
hex | 73887e867 |
31013202023 has 8 divisors (see below), whose sum is σ = 31125541776. Its totient is φ = 30901046400.
The previous prime is 31013201987. The next prime is 31013202037. The reversal of 31013202023 is 32020231013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31013202023 - 214 = 31013185639 is a prime.
It is a super-2 number, since 2×310132020232 (a number of 22 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 = 31013201992 and 31013202010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31013202043) 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 7 ways as a sum of consecutive naturals, for example, 296015 + ... + 386847.
It is an arithmetic number, because the mean of its divisors is an integer number (3890692722).
Almost surely, 231013202023 is an apocalyptic number.
31013202023 is a deficient number, since it is larger than the sum of its proper divisors (112339753).
31013202023 is an equidigital number, since it uses as much as digits as its factorization.
31013202023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92065.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 31013202023 its reverse (32020231013), we get a palindrome (63033433036).
The spelling of 31013202023 in words is "thirty-one billion, thirteen million, two hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •