Base | Representation |
---|---|
bin | 1000101010101001011… |
… | …0001111011001001000 |
3 | 112020022011212101021121 |
4 | 2022222112033121020 |
5 | 4414410013020000 |
6 | 152221521445024 |
7 | 13520361205255 |
oct | 2125226173110 |
9 | 466264771247 |
10 | 148886845000 |
11 | 58162819343 |
12 | 24a31aa0774 |
13 | 11069a73b6a |
14 | 72c59ca42c |
15 | 3d15eeab1a |
hex | 22aa58f648 |
148886845000 has 40 divisors (see below), whose sum is σ = 348841889550. Its totient is φ = 59554736000.
The previous prime is 148886844949. The next prime is 148886845021. The reversal of 148886845000 is 548688841.
It can be written as a sum of positive squares in 5 ways, for example, as 23880757156 + 125006087844 = 154534^2 + 353562^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×1488868450002 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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 9 ways as a sum of consecutive naturals, for example, 14883685 + ... + 14893684.
Almost surely, 2148886845000 is an apocalyptic number.
148886845000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
148886845000 is an abundant number, since it is smaller than the sum of its proper divisors (199955044550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148886845000 is an equidigital number, since it uses as much as digits as its factorization.
148886845000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29777395 (or 29777376 counting only the distinct ones).
The product of its (nonzero) digits is 1966080, while the sum is 52.
The spelling of 148886845000 in words is "one hundred forty-eight billion, eight hundred eighty-six million, eight hundred forty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •