Base | Representation |
---|---|
bin | 1000100111100110101… |
… | …1100100101101001100 |
3 | 112011012021111022211120 |
4 | 2021321223210231030 |
5 | 4411222002304430 |
6 | 152004513320540 |
7 | 13461215145261 |
oct | 2117153445514 |
9 | 464167438746 |
10 | 148070353740 |
11 | 57883944381 |
12 | 24844566150 |
13 | 10c6986893a |
14 | 72493ab268 |
15 | 3cb94b7610 |
hex | 2279ae4b4c |
148070353740 has 48 divisors (see below), whose sum is σ = 420436396800. Its totient is φ = 38929293760.
The previous prime is 148070353733. The next prime is 148070353759. The reversal of 148070353740 is 47353070841.
148070353740 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 148070353692 and 148070353701.
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, 17374890 + ... + 17383409.
It is an arithmetic number, because the mean of its divisors is an integer number (8759091600).
Almost surely, 2148070353740 is an apocalyptic number.
148070353740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
148070353740 is an abundant number, since it is smaller than the sum of its proper divisors (272366043060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148070353740 is a wasteful number, since it uses less digits than its factorization.
148070353740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34758382 (or 34758380 counting only the distinct ones).
The product of its (nonzero) digits is 282240, while the sum is 42.
The spelling of 148070353740 in words is "one hundred forty-eight billion, seventy million, three hundred fifty-three thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •