Base | Representation |
---|---|
bin | 1000100111111011110… |
… | …1110010001001010100 |
3 | 112011102110022201002220 |
4 | 2021332331302021110 |
5 | 4411412201412320 |
6 | 152021401502340 |
7 | 13463342556363 |
oct | 2117675621124 |
9 | 464373281086 |
10 | 148159013460 |
11 | 5791999a777 |
12 | 2486a1a19b0 |
13 | 10c8203b803 |
14 | 72570897da |
15 | 3cc217be40 |
hex | 227ef72254 |
148159013460 has 48 divisors (see below), whose sum is σ = 414861953856. Its totient is φ = 39507478272.
The previous prime is 148159013459. The next prime is 148159013467. The reversal of 148159013460 is 64310951841.
148159013460 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1481590134602 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148159013467) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2815107 + ... + 2867253.
It is an arithmetic number, because the mean of its divisors is an integer number (8642957372).
Almost surely, 2148159013460 is an apocalyptic number.
148159013460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
148159013460 is an abundant number, since it is smaller than the sum of its proper divisors (266702940396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148159013460 is a wasteful number, since it uses less digits than its factorization.
148159013460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99512 (or 99510 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 42.
The spelling of 148159013460 in words is "one hundred forty-eight billion, one hundred fifty-nine million, thirteen thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •