Base | Representation |
---|---|
bin | 1000100111101010101… |
… | …1010110000111011000 |
3 | 112011020102221122212110 |
4 | 2021322223112013120 |
5 | 4411240242234232 |
6 | 152010311512320 |
7 | 13461510223224 |
oct | 2117253260730 |
9 | 464212848773 |
10 | 148087071192 |
11 | 57892322455 |
12 | 2484a0886a0 |
13 | 10c7016cc18 |
14 | 724b6bd784 |
15 | 3cbabbaacc |
hex | 227aad61d8 |
148087071192 has 32 divisors (see below), whose sum is σ = 370229644800. Its totient is φ = 49360761504.
The previous prime is 148087071173. The next prime is 148087071193. The reversal of 148087071192 is 291170780841.
148087071192 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148087071193) by changing a digit.
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, 838309 + ... + 999467.
It is an arithmetic number, because the mean of its divisors is an integer number (11569676400).
Almost surely, 2148087071192 is an apocalyptic number.
148087071192 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
148087071192 is an abundant number, since it is smaller than the sum of its proper divisors (222142573608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148087071192 is a wasteful number, since it uses less digits than its factorization.
148087071192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199455 (or 199451 counting only the distinct ones).
The product of its (nonzero) digits is 225792, while the sum is 48.
The spelling of 148087071192 in words is "one hundred forty-eight billion, eighty-seven million, seventy-one thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •