Base | Representation |
---|---|
bin | 11011001000111000… |
… | …110000010111000101 |
3 | 2210012211021201210112 |
4 | 123020320300113011 |
5 | 434134333001000 |
6 | 21215314002405 |
7 | 2051055656006 |
oct | 331070602705 |
9 | 83184251715 |
10 | 29140125125 |
11 | 113a3928341 |
12 | 5792b76405 |
13 | 29951aa1b7 |
14 | 15a61751ad |
15 | b583c6235 |
hex | 6c8e305c5 |
29140125125 has 8 divisors (see below), whose sum is σ = 36366876312. Its totient is φ = 23312100000.
The previous prime is 29140125121. The next prime is 29140125137. The reversal of 29140125125 is 52152104192.
It can be written as a sum of positive squares in 4 ways, for example, as 1362569569 + 27777555556 = 36913^2 + 166666^2 .
It is not a de Polignac number, because 29140125125 - 22 = 29140125121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 29140125091 and 29140125100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29140125121) 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, 116560376 + ... + 116560625.
It is an arithmetic number, because the mean of its divisors is an integer number (4545859539).
Almost surely, 229140125125 is an apocalyptic number.
29140125125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
29140125125 is a deficient number, since it is larger than the sum of its proper divisors (7226751187).
29140125125 is an equidigital number, since it uses as much as digits as its factorization.
29140125125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233121016 (or 233121006 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 32.
The spelling of 29140125125 in words is "twenty-nine billion, one hundred forty million, one hundred twenty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •