Base | Representation |
---|---|
bin | 1000100111110011101… |
… | …1001010000101100000 |
3 | 112011100001212222210220 |
4 | 2021330323022011200 |
5 | 4411324420130111 |
6 | 152014135523040 |
7 | 13462445530212 |
oct | 2117473120540 |
9 | 464301788726 |
10 | 148124770656 |
11 | 57901631635 |
12 | 2485a829480 |
13 | 10c77c0c5b5 |
14 | 72526d45b2 |
15 | 3cbe165e06 |
hex | 227ceca160 |
148124770656 has 24 divisors (see below), whose sum is σ = 388827523224. Its totient is φ = 49374923520.
The previous prime is 148124770649. The next prime is 148124770667. The reversal of 148124770656 is 656077421841.
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 148124770599 and 148124770608.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 771483085 + ... + 771483276.
It is an arithmetic number, because the mean of its divisors is an integer number (16201146801).
Almost surely, 2148124770656 is an apocalyptic number.
148124770656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
148124770656 is an abundant number, since it is smaller than the sum of its proper divisors (240702752568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148124770656 is a wasteful number, since it uses less digits than its factorization.
148124770656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1542966374 (or 1542966366 counting only the distinct ones).
The product of its (nonzero) digits is 2257920, while the sum is 51.
The spelling of 148124770656 in words is "one hundred forty-eight billion, one hundred twenty-four million, seven hundred seventy thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •