Base | Representation |
---|---|
bin | 1101001111001101110010… |
… | …01011010000100001001001 |
3 | 10211001220020221000222101202 |
4 | 12213212321023100201021 |
5 | 12303414441111214233 |
6 | 141524554555553545 |
7 | 6063064263143636 |
oct | 647467113204111 |
9 | 124056227028352 |
10 | 29110100101193 |
11 | 9303584676831 |
12 | 332189575b8b5 |
13 | 13320bc31b1a7 |
14 | 728d1754318d |
15 | 35734932ebe8 |
hex | 1a79b92d0849 |
29110100101193 has 8 divisors (see below), whose sum is σ = 29122980004512. Its totient is φ = 29097221650816.
The previous prime is 29110100101127. The next prime is 29110100101207. The reversal of 29110100101193 is 39110100101192.
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 29110100101193 - 216 = 29110100035657 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (29110100101393) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40741646 + ... + 41449992.
It is an arithmetic number, because the mean of its divisors is an integer number (3640372500564).
Almost surely, 229110100101193 is an apocalyptic number.
It is an amenable number.
29110100101193 is a deficient number, since it is larger than the sum of its proper divisors (12879903319).
29110100101193 is a wasteful number, since it uses less digits than its factorization.
29110100101193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 726471.
The product of its (nonzero) digits is 486, while the sum is 29.
Subtracting 29110100101193 from its reverse (39110100101192), we obtain a palindrome (9999999999999).
The spelling of 29110100101193 in words is "twenty-nine trillion, one hundred ten billion, one hundred million, one hundred one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •