Base | Representation |
---|---|
bin | 11011000110100100… |
… | …010011100111101101 |
3 | 2210010010001122102001 |
4 | 123012210103213231 |
5 | 434044402210333 |
6 | 21211403532301 |
7 | 2050104130054 |
oct | 330644234755 |
9 | 83103048361 |
10 | 29101210093 |
11 | 1138396895a |
12 | 5781b2a091 |
13 | 298a103457 |
14 | 15a0d2539b |
15 | b54c8ab7d |
hex | 6c69139ed |
29101210093 has 8 divisors (see below), whose sum is σ = 29403465336. Its totient is φ = 28799232000.
The previous prime is 29101210057. The next prime is 29101210109. The reversal of 29101210093 is 39001210192.
It can be written as a sum of positive squares in 4 ways, for example, as 7921356004 + 21179854089 = 89002^2 + 145533^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 29101210093 - 221 = 29099112941 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29101210003) 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 in 7 ways as a sum of consecutive naturals, for example, 145233 + ... + 281593.
It is an arithmetic number, because the mean of its divisors is an integer number (3675433167).
Almost surely, 229101210093 is an apocalyptic number.
It is an amenable number.
29101210093 is a deficient number, since it is larger than the sum of its proper divisors (302255243).
29101210093 is a wasteful number, since it uses less digits than its factorization.
29101210093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138575.
The product of its (nonzero) digits is 972, while the sum is 28.
Subtracting 29101210093 from its reverse (39001210192), we obtain a palindrome (9900000099).
The spelling of 29101210093 in words is "twenty-nine billion, one hundred one million, two hundred ten thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •