Base | Representation |
---|---|
bin | 100011011001111000111101… |
… | …0100101001000010010111101 |
3 | 1111211122121102221100211200201 |
4 | 1012303301322211020102331 |
5 | 311304312311041031104 |
6 | 3022201025521323501 |
7 | 122411315130330322 |
oct | 10663617245102275 |
9 | 1454577387324621 |
10 | 311421545252029 |
11 | 90257154608543 |
12 | 2ab176b9496591 |
13 | 1049cc05a19334 |
14 | 56c8c51778b49 |
15 | 2600bc81650a4 |
hex | 11b3c7a9484bd |
311421545252029 has 2 divisors, whose sum is σ = 311421545252030. Its totient is φ = 311421545252028.
The previous prime is 311421545251961. The next prime is 311421545252039. The reversal of 311421545252029 is 920252545124113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 221029027032025 + 90392518220004 = 14867045^2 + 9507498^2 .
It is a cyclic number.
It is not a de Polignac number, because 311421545252029 - 29 = 311421545251517 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 311421545252029.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311421545252039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155710772626014 + 155710772626015.
It is an arithmetic number, because the mean of its divisors is an integer number (155710772626015).
Almost surely, 2311421545252029 is an apocalyptic number.
It is an amenable number.
311421545252029 is a deficient number, since it is larger than the sum of its proper divisors (1).
311421545252029 is an equidigital number, since it uses as much as digits as its factorization.
311421545252029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864000, while the sum is 46.
The spelling of 311421545252029 in words is "three hundred eleven trillion, four hundred twenty-one billion, five hundred forty-five million, two hundred fifty-two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •