Base | Representation |
---|---|
bin | 1000101001101101000… |
… | …1101011011110011110 |
3 | 112012122120002001220020 |
4 | 2022123101223132132 |
5 | 4413400300203240 |
6 | 152140450133010 |
7 | 13511201035635 |
oct | 2123321533636 |
9 | 465576061806 |
10 | 148633991070 |
11 | 58043016454 |
12 | 24981281166 |
13 | 11029572456 |
14 | 72a01aa51c |
15 | 3cedc010d0 |
hex | 229b46b79e |
148633991070 has 32 divisors (see below), whose sum is σ = 356798742912. Its totient is φ = 39627157152.
The previous prime is 148633991039. The next prime is 148633991081. The reversal of 148633991070 is 70199336841.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 394252 + ... + 672831.
It is an arithmetic number, because the mean of its divisors is an integer number (11149960716).
Almost surely, 2148633991070 is an apocalyptic number.
148633991070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
148633991070 is an abundant number, since it is smaller than the sum of its proper divisors (208164751842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148633991070 is a wasteful number, since it uses less digits than its factorization.
148633991070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1071736.
The product of its (nonzero) digits is 979776, while the sum is 51.
The spelling of 148633991070 in words is "one hundred forty-eight billion, six hundred thirty-three million, nine hundred ninety-one thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •