Base | Representation |
---|---|
bin | 1000100000001010011… |
… | …0010101100001111111 |
3 | 111222001001011102222012 |
4 | 2020002212111201333 |
5 | 4343124024222114 |
6 | 151034344241435 |
7 | 13360545461036 |
oct | 2100246254177 |
9 | 458031142865 |
10 | 146072492159 |
11 | 56a49128400 |
12 | 2438747027b |
13 | 10a0b98ca19 |
14 | 70d9d0b71d |
15 | 3beddc863e |
hex | 220299587f |
146072492159 has 12 divisors (see below), whose sum is σ = 163191143640. Its totient is φ = 130616230800.
The previous prime is 146072492147. The next prime is 146072492161. The reversal of 146072492159 is 951294270641.
It is not a de Polignac number, because 146072492159 - 228 = 145804056703 is a prime.
It is a super-2 number, since 2×1460724921592 (a number of 23 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (50) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146072492959) 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 11 ways as a sum of consecutive naturals, for example, 9887789 + ... + 9902550.
It is an arithmetic number, because the mean of its divisors is an integer number (13599261970).
Almost surely, 2146072492159 is an apocalyptic number.
146072492159 is a deficient number, since it is larger than the sum of its proper divisors (17118651481).
146072492159 is a wasteful number, since it uses less digits than its factorization.
146072492159 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19790422 (or 19790411 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 50.
The spelling of 146072492159 in words is "one hundred forty-six billion, seventy-two million, four hundred ninety-two thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •