Base | Representation |
---|---|
bin | 100110000100000111000… |
… | …1011000101100100111101 |
3 | 200112010102210011201021011 |
4 | 1030020032023011210331 |
5 | 1141203112014011411 |
6 | 15043153243235221 |
7 | 1046651433621241 |
oct | 114101613054475 |
9 | 20463383151234 |
10 | 5231507953981 |
11 | 1737740944951 |
12 | 705a99518b11 |
13 | 2bc437cc3c9a |
14 | 1412c6286421 |
15 | 9113bd8ac21 |
hex | 4c20e2c593d |
5231507953981 has 2 divisors, whose sum is σ = 5231507953982. Its totient is φ = 5231507953980.
The previous prime is 5231507953957. The next prime is 5231507953993. The reversal of 5231507953981 is 1893597051325.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3615736477081 + 1615771476900 = 1901509^2 + 1271130^2 .
It is a cyclic number.
It is not a de Polignac number, because 5231507953981 - 231 = 5229360470333 is a prime.
It is a super-2 number, since 2×52315079539812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5231507953901) 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 as a sum of consecutive naturals, namely, 2615753976990 + 2615753976991.
It is an arithmetic number, because the mean of its divisors is an integer number (2615753976991).
Almost surely, 25231507953981 is an apocalyptic number.
It is an amenable number.
5231507953981 is a deficient number, since it is larger than the sum of its proper divisors (1).
5231507953981 is an equidigital number, since it uses as much as digits as its factorization.
5231507953981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10206000, while the sum is 58.
The spelling of 5231507953981 in words is "five trillion, two hundred thirty-one billion, five hundred seven million, nine hundred fifty-three thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •