Base | Representation |
---|---|
bin | 1110001111100010100110… |
… | …11011110100101011100001 |
3 | 11002220012011122120101012010 |
4 | 13013301103123310223201 |
5 | 13101122434114400100 |
6 | 150340203042423133 |
7 | 6411550156443246 |
oct | 707612333645341 |
9 | 132805148511163 |
10 | 31320301325025 |
11 | 9a85957641209 |
12 | 361a101661aa9 |
13 | 146265148423b |
14 | 7a3ca6c575cd |
15 | 394aa613b750 |
hex | 1c7c536f4ae1 |
31320301325025 has 12 divisors (see below), whose sum is σ = 51782898190832. Its totient is φ = 16704160706640.
The previous prime is 31320301325021. The next prime is 31320301325041. The reversal of 31320301325025 is 52052310302313.
It is a happy number.
It is not a de Polignac number, because 31320301325025 - 22 = 31320301325021 is a prime.
It is a super-2 number, since 2×313203013250252 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31320301324983 and 31320301325001.
It is not an unprimeable number, because it can be changed into a prime (31320301325021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 208802008759 + ... + 208802008908.
Almost surely, 231320301325025 is an apocalyptic number.
It is an amenable number.
31320301325025 is a deficient number, since it is larger than the sum of its proper divisors (20462596865807).
31320301325025 is a wasteful number, since it uses less digits than its factorization.
31320301325025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417604017680 (or 417604017675 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 31320301325025 its reverse (52052310302313), we get a palindrome (83372611627338).
The spelling of 31320301325025 in words is "thirty-one trillion, three hundred twenty billion, three hundred one million, three hundred twenty-five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •