Base | Representation |
---|---|
bin | 10001101010001… |
… | …00101011001011 |
3 | 101022201210212002 |
4 | 20311010223023 |
5 | 300410134012 |
6 | 22410541215 |
7 | 3446042240 |
oct | 1065045313 |
9 | 338653762 |
10 | 148130507 |
11 | 76685708 |
12 | 4173780b |
13 | 248c5cb5 |
14 | 1595d5c7 |
15 | d0107c2 |
hex | 8d44acb |
148130507 has 4 divisors (see below), whose sum is σ = 169292016. Its totient is φ = 126969000.
The previous prime is 148130471. The next prime is 148130519. The reversal of 148130507 is 705031841.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 705031841 = 19 ⋅37106939.
It is a cyclic number.
It is not a de Polignac number, because 148130507 - 212 = 148126411 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 148130507.
It is not an unprimeable number, because it can be changed into a prime (148130597) 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 3 ways as a sum of consecutive naturals, for example, 10580744 + ... + 10580757.
It is an arithmetic number, because the mean of its divisors is an integer number (42323004).
Almost surely, 2148130507 is an apocalyptic number.
148130507 is a deficient number, since it is larger than the sum of its proper divisors (21161509).
148130507 is an equidigital number, since it uses as much as digits as its factorization.
148130507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21161508.
The product of its (nonzero) digits is 3360, while the sum is 29.
The square root of 148130507 is about 12170.8876833204. The cubic root of 148130507 is about 529.1126804728.
The spelling of 148130507 in words is "one hundred forty-eight million, one hundred thirty thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •