Base | Representation |
---|---|
bin | 1110001111100100010101… |
… | …10110010010100011101111 |
3 | 11002220021120102221021021010 |
4 | 13013302022312102203233 |
5 | 13101131340114310111 |
6 | 150340435213040303 |
7 | 6411612205566204 |
oct | 707621266224357 |
9 | 132807512837233 |
10 | 31321231010031 |
11 | 9a862943a9326 |
12 | 361a320a86093 |
13 | 146276bc72401 |
14 | 7a3d544ddcab |
15 | 394b0ca7daa6 |
hex | 1c7c8ad928ef |
31321231010031 has 8 divisors (see below), whose sum is σ = 42131213394480. Its totient is φ = 20696034649472.
The previous prime is 31321231009973. The next prime is 31321231010077. The reversal of 31321231010031 is 13001013212313.
It is a happy number.
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 31321231010031 - 26 = 31321231009967 is a prime.
It is a super-2 number, since 2×313212310100312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31321231010131) 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, 46196505576 + ... + 46196506253.
It is an arithmetic number, because the mean of its divisors is an integer number (5266401674310).
Almost surely, 231321231010031 is an apocalyptic number.
31321231010031 is a deficient number, since it is larger than the sum of its proper divisors (10809982384449).
31321231010031 is a wasteful number, since it uses less digits than its factorization.
31321231010031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92393011945.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 31321231010031 its reverse (13001013212313), we get a palindrome (44322244222344).
The spelling of 31321231010031 in words is "thirty-one trillion, three hundred twenty-one billion, two hundred thirty-one million, ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •