Base | Representation |
---|---|
bin | 110111000110001010… |
… | …011100111001010101 |
3 | 12122200220110220122220 |
4 | 313012022130321111 |
5 | 1432124224002123 |
6 | 43102151012553 |
7 | 4163006634462 |
oct | 670612347125 |
9 | 178626426586 |
10 | 59159203413 |
11 | 230a8912152 |
12 | b57036a159 |
13 | 576a4c200b |
14 | 2c12d48669 |
15 | 1813a1cce3 |
hex | dc629ce55 |
59159203413 has 8 divisors (see below), whose sum is σ = 79159646976. Its totient is φ = 39299114400.
The previous prime is 59159203403. The next prime is 59159203423. The reversal of 59159203413 is 31430295195.
It is an interprime number because it is at equal distance from previous prime (59159203403) and next prime (59159203423).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 59159203413 - 218 = 59158941269 is a prime.
It is a super-2 number, since 2×591592034132 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (59159203403) 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, 35087653 + ... + 35089338.
It is an arithmetic number, because the mean of its divisors is an integer number (9894955872).
Almost surely, 259159203413 is an apocalyptic number.
It is an amenable number.
59159203413 is a deficient number, since it is larger than the sum of its proper divisors (20000443563).
59159203413 is a wasteful number, since it uses less digits than its factorization.
59159203413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70177275.
The product of its (nonzero) digits is 145800, while the sum is 42.
The spelling of 59159203413 in words is "fifty-nine billion, one hundred fifty-nine million, two hundred three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •