Base | Representation |
---|---|
bin | 1000100111101010100… |
… | …1100110110100111000 |
3 | 112011020102002111120111 |
4 | 2021322221212310320 |
5 | 4411240133142402 |
6 | 152010254034104 |
7 | 13461503314234 |
oct | 2117251466470 |
9 | 464212074514 |
10 | 148086615352 |
11 | 57892040a25 |
12 | 24849aa8934 |
13 | 10c700405b0 |
14 | 724b6015c4 |
15 | 3cbab2a9d7 |
hex | 227aa66d38 |
148086615352 has 64 divisors (see below), whose sum is σ = 313727420160. Its totient is φ = 65058508800.
The previous prime is 148086615349. The next prime is 148086615361. The reversal of 148086615352 is 253516680841.
148086615352 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×1480866153522 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 148086615296 and 148086615305.
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 15 ways as a sum of consecutive naturals, for example, 179833 + ... + 573160.
It is an arithmetic number, because the mean of its divisors is an integer number (4901990940).
Almost surely, 2148086615352 is an apocalyptic number.
It is an amenable number.
148086615352 is an abundant number, since it is smaller than the sum of its proper divisors (165640804808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148086615352 is a wasteful number, since it uses less digits than its factorization.
148086615352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 753104 (or 753100 counting only the distinct ones).
The product of its (nonzero) digits is 1382400, while the sum is 49.
The spelling of 148086615352 in words is "one hundred forty-eight billion, eighty-six million, six hundred fifteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •