Base | Representation |
---|---|
bin | 1000100000011110100… |
… | …1111111100100100110 |
3 | 111222020221211000000220 |
4 | 2020013221333210212 |
5 | 4343312234234440 |
6 | 151051014545210 |
7 | 13362625602516 |
oct | 2100751774446 |
9 | 458227730026 |
10 | 146157336870 |
11 | 56a920084a6 |
12 | 243ab968206 |
13 | 10a234282ac |
14 | 71072b5846 |
15 | 3c065878d0 |
hex | 2207a7f926 |
146157336870 has 16 divisors (see below), whose sum is σ = 350777608560. Its totient is φ = 38975289824.
The previous prime is 146157336811. The next prime is 146157336947. The reversal of 146157336870 is 78633751641.
146157336870 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1461573368702 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 2435955585 + ... + 2435955644.
It is an arithmetic number, because the mean of its divisors is an integer number (21923600535).
Almost surely, 2146157336870 is an apocalyptic number.
146157336870 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146157336870 is an abundant number, since it is smaller than the sum of its proper divisors (204620271690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146157336870 is a wasteful number, since it uses less digits than its factorization.
146157336870 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4871911239.
The product of its (nonzero) digits is 2540160, while the sum is 51.
The spelling of 146157336870 in words is "one hundred forty-six billion, one hundred fifty-seven million, three hundred thirty-six thousand, eight hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •