Base | Representation |
---|---|
bin | 1110001111100110001001… |
… | …01010100110001000101111 |
3 | 11002220101002001012000221020 |
4 | 13013303010222212020233 |
5 | 13101140331430214043 |
6 | 150341115343505223 |
7 | 6411645224554341 |
oct | 707630452461057 |
9 | 132811061160836 |
10 | 31322201023023 |
11 | 9a86741a00459 |
12 | 361a5518b8213 |
13 | 1462894c104b1 |
14 | 7a4007283291 |
15 | 394b67cd9e83 |
hex | 1c7cc4aa622f |
31322201023023 has 16 divisors (see below), whose sum is σ = 44219760732000. Its totient is φ = 19653064487936.
The previous prime is 31322201023007. The next prime is 31322201023037. The reversal of 31322201023023 is 32032010222313.
It is a cyclic number.
It is not a de Polignac number, because 31322201023023 - 24 = 31322201023007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31322201022984 and 31322201023002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31322201027023) 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 15 ways as a sum of consecutive naturals, for example, 12674011 + ... + 14942387.
It is an arithmetic number, because the mean of its divisors is an integer number (2763735045750).
Almost surely, 231322201023023 is an apocalyptic number.
31322201023023 is a deficient number, since it is larger than the sum of its proper divisors (12897559708977).
31322201023023 is a wasteful number, since it uses less digits than its factorization.
31322201023023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2539146.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 31322201023023 its reverse (32032010222313), we get a palindrome (63354211245336).
The spelling of 31322201023023 in words is "thirty-one trillion, three hundred twenty-two billion, two hundred one million, twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •