Base | Representation |
---|---|
bin | 1110001100010111011011… |
… | …10111001010010010111111 |
3 | 11002111202121210112000111022 |
4 | 13012023231313022102333 |
5 | 13042331041044024043 |
6 | 150214123220214355 |
7 | 6400636126323155 |
oct | 706135567122277 |
9 | 132452553460438 |
10 | 31211223033023 |
11 | 9a436727aaa50 |
12 | 3600b3b53a3bb |
13 | 1455289c116a7 |
14 | 79c8ba2413d5 |
15 | 391d1ee0c868 |
hex | 1c62eddca4bf |
31211223033023 has 8 divisors (see below), whose sum is σ = 34048669458816. Its totient is φ = 28373787026200.
The previous prime is 31211223033013. The next prime is 31211223033043. The reversal of 31211223033023 is 32033032211213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31211223033023 - 216 = 31211222967487 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31211223032983 and 31211223033001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31211223033013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4501838 + ... + 9093348.
It is an arithmetic number, because the mean of its divisors is an integer number (4256083682352).
Almost surely, 231211223033023 is an apocalyptic number.
31211223033023 is a deficient number, since it is larger than the sum of its proper divisors (2837446425793).
31211223033023 is a wasteful number, since it uses less digits than its factorization.
31211223033023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5209485.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 31211223033023 its reverse (32033032211213), we get a palindrome (63244255244236).
The spelling of 31211223033023 in words is "thirty-one trillion, two hundred eleven billion, two hundred twenty-three million, thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •