Base | Representation |
---|---|
bin | 11011000011101110… |
… | …101110010001011011 |
3 | 2202222210111021001111 |
4 | 123003232232101123 |
5 | 434000210442201 |
6 | 21202543401151 |
7 | 2045655413365 |
oct | 330356562133 |
9 | 82883437044 |
10 | 29053609051 |
11 | 1135a006555 |
12 | 5769bb31b7 |
13 | 29802a7c5c |
14 | 1598893d35 |
15 | b509d6b51 |
hex | 6c3bae45b |
29053609051 has 4 divisors (see below), whose sum is σ = 29762233704. Its totient is φ = 28344984400.
The previous prime is 29053609027. The next prime is 29053609063. The reversal of 29053609051 is 15090635092.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 29053609051 - 25 = 29053609019 is a prime.
It is a super-2 number, since 2×290536090512 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 29053608995 and 29053609013.
It is not an unprimeable number, because it can be changed into a prime (29053609001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 354312265 + ... + 354312346.
It is an arithmetic number, because the mean of its divisors is an integer number (7440558426).
Almost surely, 229053609051 is an apocalyptic number.
29053609051 is a deficient number, since it is larger than the sum of its proper divisors (708624653).
29053609051 is an equidigital number, since it uses as much as digits as its factorization.
29053609051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 708624652.
The product of its (nonzero) digits is 72900, while the sum is 40.
The spelling of 29053609051 in words is "twenty-nine billion, fifty-three million, six hundred nine thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •