Base | Representation |
---|---|
bin | 1110010000100001110110… |
… | …00011111100100100000001 |
3 | 11010000102210202001000222201 |
4 | 13020100323003330210001 |
5 | 13102202002022313131 |
6 | 150403540010433201 |
7 | 6414161411631301 |
oct | 710207303744401 |
9 | 133012722030881 |
10 | 31354252151041 |
11 | 9a99299a32306 |
12 | 36247b7732801 |
13 | 14659022115c1 |
14 | 7a57a7c95601 |
15 | 3958e1a25761 |
hex | 1c843b0fc901 |
31354252151041 has 2 divisors, whose sum is σ = 31354252151042. Its totient is φ = 31354252151040.
The previous prime is 31354252151011. The next prime is 31354252151069. The reversal of 31354252151041 is 14015125245313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26657188563600 + 4697063587441 = 5163060^2 + 2167271^2 .
It is a cyclic number.
It is not a de Polignac number, because 31354252151041 - 211 = 31354252148993 is a prime.
It is not a weakly prime, because it can be changed into another prime (31354252151011) 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, 15677126075520 + 15677126075521.
It is an arithmetic number, because the mean of its divisors is an integer number (15677126075521).
Almost surely, 231354252151041 is an apocalyptic number.
It is an amenable number.
31354252151041 is a deficient number, since it is larger than the sum of its proper divisors (1).
31354252151041 is an equidigital number, since it uses as much as digits as its factorization.
31354252151041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72000, while the sum is 37.
Adding to 31354252151041 its reverse (14015125245313), we get a palindrome (45369377396354).
The spelling of 31354252151041 in words is "thirty-one trillion, three hundred fifty-four billion, two hundred fifty-two million, one hundred fifty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •