Base | Representation |
---|---|
bin | 10001101001010… |
… | …01111100110111 |
3 | 101022112020201000 |
4 | 20310221330313 |
5 | 300343133142 |
6 | 22404334343 |
7 | 3445105146 |
oct | 1064517467 |
9 | 338466630 |
10 | 148021047 |
11 | 76610449 |
12 | 416a43b3 |
13 | 24888225 |
14 | 1593175d |
15 | cedd14c |
hex | 8d29f37 |
148021047 has 8 divisors (see below), whose sum is σ = 219290480. Its totient is φ = 98680680.
The previous prime is 148021033. The next prime is 148021051. The reversal of 148021047 is 740120841.
It is not a de Polignac number, because 148021047 - 210 = 148020023 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 5482261 = 148021047 / (1 + 4 + 8 + 0 + 2 + 1 + 0 + 4 + 7).
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 148021047.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148021087) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2741104 + ... + 2741157.
It is an arithmetic number, because the mean of its divisors is an integer number (27411310).
Almost surely, 2148021047 is an apocalyptic number.
148021047 is a deficient number, since it is larger than the sum of its proper divisors (71269433).
148021047 is an equidigital number, since it uses as much as digits as its factorization.
148021047 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5482270 (or 5482264 counting only the distinct ones).
The product of its (nonzero) digits is 1792, while the sum is 27.
The square root of 148021047 is about 12166.3900562163. The cubic root of 148021047 is about 528.9823203223.
Adding to 148021047 its reverse (740120841), we get a palindrome (888141888).
The spelling of 148021047 in words is "one hundred forty-eight million, twenty-one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •