Base | Representation |
---|---|
bin | 110110111110011101… |
… | …010000011000001011 |
3 | 12122100220012101111121 |
4 | 312332131100120023 |
5 | 1431343124241042 |
6 | 43041251540111 |
7 | 4156546666660 |
oct | 667635203013 |
9 | 178326171447 |
10 | 59029915147 |
11 | 23041936a45 |
12 | b534bba637 |
13 | 5749795498 |
14 | 2bddad1a67 |
15 | 18074d0367 |
hex | dbe75060b |
59029915147 has 16 divisors (see below), whose sum is σ = 68759884800. Its totient is φ = 49628852640.
The previous prime is 59029915129. The next prime is 59029915169. The reversal of 59029915147 is 74151992095.
It is a cyclic number.
It is not a de Polignac number, because 59029915147 - 211 = 59029913099 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 59029915094 and 59029915103.
It is not an unprimeable number, because it can be changed into a prime (59029915117) 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 15 ways as a sum of consecutive naturals, for example, 39247 + ... + 345832.
It is an arithmetic number, because the mean of its divisors is an integer number (4297492800).
Almost surely, 259029915147 is an apocalyptic number.
59029915147 is a deficient number, since it is larger than the sum of its proper divisors (9729969653).
59029915147 is a wasteful number, since it uses less digits than its factorization.
59029915147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385506.
The product of its (nonzero) digits is 1020600, while the sum is 52.
The spelling of 59029915147 in words is "fifty-nine billion, twenty-nine million, nine hundred fifteen thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •