Base | Representation |
---|---|
bin | 10001101101010… |
… | …10000111111111 |
3 | 101100111220212110 |
4 | 20312222013333 |
5 | 301011433142 |
6 | 22423505103 |
7 | 3452422566 |
oct | 1066520777 |
9 | 340456773 |
10 | 148546047 |
11 | 76939931 |
12 | 418b8193 |
13 | 24a10190 |
14 | 15a2abdd |
15 | d09399c |
hex | 8daa1ff |
148546047 has 16 divisors (see below), whose sum is σ = 224524160. Its totient is φ = 86601312.
The previous prime is 148546031. The next prime is 148546063. The reversal of 148546047 is 740645841.
It is an interprime number because it is at equal distance from previous prime (148546031) and next prime (148546063).
It is not a de Polignac number, because 148546047 - 24 = 148546031 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 148545996 and 148546014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148546147) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 99493 + ... + 100974.
It is an arithmetic number, because the mean of its divisors is an integer number (14032760).
Almost surely, 2148546047 is an apocalyptic number.
148546047 is a deficient number, since it is larger than the sum of its proper divisors (75978113).
148546047 is a wasteful number, since it uses less digits than its factorization.
148546047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200502.
The product of its (nonzero) digits is 107520, while the sum is 39.
The square root of 148546047 is about 12187.9467918103. The cubic root of 148546047 is about 529.6069793057.
The spelling of 148546047 in words is "one hundred forty-eight million, five hundred forty-six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •