Base | Representation |
---|---|
bin | 1000101101001001101… |
… | …1000110001001110001 |
3 | 112022001001000212212212 |
4 | 2023102123012021301 |
5 | 4422244124102023 |
6 | 152412340501505 |
7 | 13543134165023 |
oct | 2132233061161 |
9 | 468031025785 |
10 | 149559206513 |
11 | 58478300512 |
12 | 24b9b0aa895 |
13 | 11146157102 |
14 | 734b00c013 |
15 | 3d5505de78 |
hex | 22d26c6271 |
149559206513 has 16 divisors (see below), whose sum is σ = 153981751680. Its totient is φ = 145200217344.
The previous prime is 149559206491. The next prime is 149559206543. The reversal of 149559206513 is 315602955941.
It is a cyclic number.
It is not a de Polignac number, because 149559206513 - 28 = 149559206257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (149559206543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3687020 + ... + 3727362.
It is an arithmetic number, because the mean of its divisors is an integer number (9623859480).
Almost surely, 2149559206513 is an apocalyptic number.
It is an amenable number.
149559206513 is a deficient number, since it is larger than the sum of its proper divisors (4422545167).
149559206513 is a wasteful number, since it uses less digits than its factorization.
149559206513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41128.
The product of its (nonzero) digits is 1458000, while the sum is 50.
The spelling of 149559206513 in words is "one hundred forty-nine billion, five hundred fifty-nine million, two hundred six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •