Base | Representation |
---|---|
bin | 1110001010011100010100… |
… | …01000110000100110011001 |
3 | 11002021110000100012010202102 |
4 | 13011032022020300212121 |
5 | 13040240204101242241 |
6 | 150123512331013145 |
7 | 6363106145666321 |
oct | 705161210604631 |
9 | 132243010163672 |
10 | 31145125415321 |
11 | 9a18634388515 |
12 | 35b017359a1b5 |
13 | 144bc850ca3b8 |
14 | 799609a0c281 |
15 | 3902521dd39b |
hex | 1c538a230999 |
31145125415321 has 2 divisors, whose sum is σ = 31145125415322. Its totient is φ = 31145125415320.
The previous prime is 31145125415309. The next prime is 31145125415347. The reversal of 31145125415321 is 12351452154113.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28680994655296 + 2464130760025 = 5355464^2 + 1569755^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31145125415321 is a prime.
It is not a weakly prime, because it can be changed into another prime (31145125415221) 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, 15572562707660 + 15572562707661.
It is an arithmetic number, because the mean of its divisors is an integer number (15572562707661).
Almost surely, 231145125415321 is an apocalyptic number.
It is an amenable number.
31145125415321 is a deficient number, since it is larger than the sum of its proper divisors (1).
31145125415321 is an equidigital number, since it uses as much as digits as its factorization.
31145125415321 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 72000, while the sum is 38.
Adding to 31145125415321 its reverse (12351452154113), we get a palindrome (43496577569434).
The spelling of 31145125415321 in words is "thirty-one trillion, one hundred forty-five billion, one hundred twenty-five million, four hundred fifteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •