Base | Representation |
---|---|
bin | 1110001111010011001100… |
… | …00000100001001111000001 |
3 | 11002212101210201102220010121 |
4 | 13013221212000201033001 |
5 | 13101004010342000001 |
6 | 150332313401300241 |
7 | 6411135056030002 |
oct | 707514600411701 |
9 | 132771721386117 |
10 | 31312023000001 |
11 | 9a82399754087 |
12 | 3618591194681 |
13 | 1461932391c73 |
14 | 7a371d61d1a9 |
15 | 39476e4b46a1 |
hex | 1c7a660213c1 |
31312023000001 has 8 divisors (see below), whose sum is σ = 31708881547520. Its totient is φ = 30915177048288.
The previous prime is 31312022999989. The next prime is 31312023000007. The reversal of 31312023000001 is 10000032021313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31312023000001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31312023000007) 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, 1905460 + ... + 8139706.
It is an arithmetic number, because the mean of its divisors is an integer number (3963610193440).
Almost surely, 231312023000001 is an apocalyptic number.
It is an amenable number.
31312023000001 is a deficient number, since it is larger than the sum of its proper divisors (396858547519).
31312023000001 is an equidigital number, since it uses as much as digits as its factorization.
31312023000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6297903.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 31312023000001 its reverse (10000032021313), we get a palindrome (41312055021314).
The spelling of 31312023000001 in words is "thirty-one trillion, three hundred twelve billion, twenty-three million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •