Base | Representation |
---|---|
bin | 1101001101000010000111… |
… | …10101011100011011010101 |
3 | 10210210201201020002222221102 |
4 | 12212201003311130123111 |
5 | 12301202404423121001 |
6 | 141430314255555445 |
7 | 6054501160300406 |
oct | 646410365343325 |
9 | 123721636088842 |
10 | 29035117004501 |
11 | 92847a6672433 |
12 | 330b249b2bb85 |
13 | 1327ccc6b2a1a |
14 | 725442bc99ad |
15 | 35540b505e6b |
hex | 1a6843d5c6d5 |
29035117004501 has 2 divisors, whose sum is σ = 29035117004502. Its totient is φ = 29035117004500.
The previous prime is 29035117004489. The next prime is 29035117004591. The reversal of 29035117004501 is 10540071153092.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23953203428401 + 5081913576100 = 4894201^2 + 2254310^2 .
It is a cyclic number.
It is not a de Polignac number, because 29035117004501 - 214 = 29035116988117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (29035117004591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14517558502250 + 14517558502251.
It is an arithmetic number, because the mean of its divisors is an integer number (14517558502251).
Almost surely, 229035117004501 is an apocalyptic number.
It is an amenable number.
29035117004501 is a deficient number, since it is larger than the sum of its proper divisors (1).
29035117004501 is an equidigital number, since it uses as much as digits as its factorization.
29035117004501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37800, while the sum is 38.
Adding to 29035117004501 its reverse (10540071153092), we get a palindrome (39575188157593).
The spelling of 29035117004501 in words is "twenty-nine trillion, thirty-five billion, one hundred seventeen million, four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •