Base | Representation |
---|---|
bin | 1110001010101001111101… |
… | …10011001101110100000001 |
3 | 11002022010220220100021211011 |
4 | 13011110332303031310001 |
5 | 13040400210030124301 |
6 | 150131123312320521 |
7 | 6363455533636021 |
oct | 705247663156401 |
9 | 132263826307734 |
10 | 31152451411201 |
11 | 9a2075375166a |
12 | 35b1678b43141 |
13 | 144c881b036c3 |
14 | 799b02987a81 |
15 | 39053044da51 |
hex | 1c553eccdd01 |
31152451411201 has 2 divisors, whose sum is σ = 31152451411202. Its totient is φ = 31152451411200.
The previous prime is 31152451411177. The next prime is 31152451411243. The reversal of 31152451411201 is 10211415425113.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30988649895025 + 163801516176 = 5566745^2 + 404724^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31152451411201 is a prime.
It is not a weakly prime, because it can be changed into another prime (31152451411801) 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 as a sum of consecutive naturals, namely, 15576225705600 + 15576225705601.
It is an arithmetic number, because the mean of its divisors is an integer number (15576225705601).
Almost surely, 231152451411201 is an apocalyptic number.
It is an amenable number.
31152451411201 is a deficient number, since it is larger than the sum of its proper divisors (1).
31152451411201 is an equidigital number, since it uses as much as digits as its factorization.
31152451411201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4800, while the sum is 31.
Adding to 31152451411201 its reverse (10211415425113), we get a palindrome (41363866836314).
The spelling of 31152451411201 in words is "thirty-one trillion, one hundred fifty-two billion, four hundred fifty-one million, four hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •