Base | Representation |
---|---|
bin | 1101011001010010000010… |
… | …11100000110001101100001 |
3 | 10212021222001010212021101101 |
4 | 12230221001130012031201 |
5 | 12330101323300203411 |
6 | 142351520403434401 |
7 | 6130060506320254 |
oct | 654510134061541 |
9 | 125258033767341 |
10 | 29455983600481 |
11 | 9427237910179 |
12 | 3378925385a01 |
13 | 13588c20c7b79 |
14 | 73b96a3b709b |
15 | 36133ec998c1 |
hex | 1aca41706361 |
29455983600481 has 2 divisors, whose sum is σ = 29455983600482. Its totient is φ = 29455983600480.
The previous prime is 29455983600457. The next prime is 29455983600521. The reversal of 29455983600481 is 18400638955492.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28617321434256 + 838662166225 = 5349516^2 + 915785^2 .
It is a cyclic number.
It is not a de Polignac number, because 29455983600481 - 27 = 29455983600353 is a prime.
It is a super-2 number, since 2×294559836004812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (29455983600581) 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, 14727991800240 + 14727991800241.
It is an arithmetic number, because the mean of its divisors is an integer number (14727991800241).
Almost surely, 229455983600481 is an apocalyptic number.
It is an amenable number.
29455983600481 is a deficient number, since it is larger than the sum of its proper divisors (1).
29455983600481 is an equidigital number, since it uses as much as digits as its factorization.
29455983600481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 74649600, while the sum is 64.
The spelling of 29455983600481 in words is "twenty-nine trillion, four hundred fifty-five billion, nine hundred eighty-three million, six hundred thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •