Base | Representation |
---|---|
bin | 1000101000101010001… |
… | …0000101101010000100 |
3 | 112011220222111022021022 |
4 | 2022022202011222010 |
5 | 4412311342024230 |
6 | 152052533210312 |
7 | 13501220242022 |
oct | 2121242055204 |
9 | 464828438238 |
10 | 148353079940 |
11 | 57a0949a79a |
12 | 24903190998 |
13 | 10cb32c9150 |
14 | 7274b65712 |
15 | 3cd42131e5 |
hex | 228a885a84 |
148353079940 has 36 divisors (see below), whose sum is σ = 335520242316. Its totient is φ = 54774228672.
The previous prime is 148353079939. The next prime is 148353079949. The reversal of 148353079940 is 49970353841.
It can be written as a sum of positive squares in 2 ways, for example, as 36517681216 + 111835398724 = 191096^2 + 334418^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148353079949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6198677 + ... + 6222563.
It is an arithmetic number, because the mean of its divisors is an integer number (9320006731).
Almost surely, 2148353079940 is an apocalyptic number.
148353079940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
148353079940 is an abundant number, since it is smaller than the sum of its proper divisors (187167162376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148353079940 is an frugal number, since it uses more digits than its factorization.
148353079940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47796 (or 23907 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 53.
The spelling of 148353079940 in words is "one hundred forty-eight billion, three hundred fifty-three million, seventy-nine thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •