Base | Representation |
---|---|
bin | 1110001111101110001011… |
… | …01101011011100000000001 |
3 | 11002220210012120220002110222 |
4 | 13013313011231123200001 |
5 | 13101223144424313101 |
6 | 150343111315232425 |
7 | 6412160131240004 |
oct | 707670555334001 |
9 | 132823176802428 |
10 | 31326513510401 |
11 | 9a8855521800a |
12 | 361b355ba8715 |
13 | 14631014b2785 |
14 | 7a42d5cdb53b |
15 | 394d1b6d901b |
hex | 1c7dc5b5b801 |
31326513510401 has 4 divisors (see below), whose sum is σ = 31327146022704. Its totient is φ = 31325880998100.
The previous prime is 31326513510361. The next prime is 31326513510419. The reversal of 31326513510401 is 10401531562313.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 31326513510401 - 234 = 31309333641217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31326513510101) 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 3 ways as a sum of consecutive naturals, for example, 316181855 + ... + 316280916.
It is an arithmetic number, because the mean of its divisors is an integer number (7831786505676).
Almost surely, 231326513510401 is an apocalyptic number.
It is an amenable number.
31326513510401 is a deficient number, since it is larger than the sum of its proper divisors (632512303).
31326513510401 is an equidigital number, since it uses as much as digits as its factorization.
31326513510401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632512302.
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 31326513510401 in words is "thirty-one trillion, three hundred twenty-six billion, five hundred thirteen million, five hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •