Base | Representation |
---|---|
bin | 1110010011010111111011… |
… | …00010111101001100000011 |
3 | 11010100210010021000202211112 |
4 | 13021223331202331030003 |
5 | 13110302201102343413 |
6 | 150520503515233535 |
7 | 6424221662552246 |
oct | 711537542751403 |
9 | 133323107022745 |
10 | 31452004340483 |
11 | a0267a1553031 |
12 | 363b7387488ab |
13 | 1471bb011ca0c |
14 | 7aa3dc59125d |
15 | 39821374c2a8 |
hex | 1c9afd8bd303 |
31452004340483 has 2 divisors, whose sum is σ = 31452004340484. Its totient is φ = 31452004340482.
The previous prime is 31452004340447. The next prime is 31452004340489. The reversal of 31452004340483 is 38404340025413.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 31452004340483 - 28 = 31452004340227 is a prime.
It is a super-3 number, since 3×314520043404833 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 31452004340483.
It is not a weakly prime, because it can be changed into another prime (31452004340489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15726002170241 + 15726002170242.
It is an arithmetic number, because the mean of its divisors is an integer number (15726002170242).
Almost surely, 231452004340483 is an apocalyptic number.
31452004340483 is a deficient number, since it is larger than the sum of its proper divisors (1).
31452004340483 is an equidigital number, since it uses as much as digits as its factorization.
31452004340483 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 552960, while the sum is 41.
Adding to 31452004340483 its reverse (38404340025413), we get a palindrome (69856344365896).
The spelling of 31452004340483 in words is "thirty-one trillion, four hundred fifty-two billion, four million, three hundred forty thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •