Base | Representation |
---|---|
bin | 11011000111111100… |
… | …100011111100000001 |
3 | 2210011201121001100201 |
4 | 123013330203330001 |
5 | 434121313024401 |
6 | 21213551445201 |
7 | 2050504565401 |
oct | 330774437401 |
9 | 83151531321 |
10 | 29124345601 |
11 | 11395a2aa0a |
12 | 5789826801 |
13 | 2991b43ac0 |
14 | 15a4028801 |
15 | b56d0ab01 |
hex | 6c7f23f01 |
29124345601 has 8 divisors (see below), whose sum is σ = 31367070504. Its totient is φ = 26881962240.
The previous prime is 29124345577. The next prime is 29124345641. The reversal of 29124345601 is 10654342192.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 959450625 + 28164894976 = 30975^2 + 167824^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 29124345601 - 213 = 29124337409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (29124345641) 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, 107955 + ... + 264391.
It is an arithmetic number, because the mean of its divisors is an integer number (3920883813).
Almost surely, 229124345601 is an apocalyptic number.
It is an amenable number.
29124345601 is a deficient number, since it is larger than the sum of its proper divisors (2242724903).
29124345601 is a wasteful number, since it uses less digits than its factorization.
29124345601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170771.
The product of its (nonzero) digits is 51840, while the sum is 37.
Adding to 29124345601 its reverse (10654342192), we get a palindrome (39778687793).
The spelling of 29124345601 in words is "twenty-nine billion, one hundred twenty-four million, three hundred forty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •