Base | Representation |
---|---|
bin | 10001101100101… |
… | …11010010111111 |
3 | 101100101000002011 |
4 | 20312113102333 |
5 | 301002001202 |
6 | 22422112051 |
7 | 3451652005 |
oct | 1066272277 |
9 | 340330064 |
10 | 148468927 |
11 | 768969a2 |
12 | 4187b627 |
13 | 249b4049 |
14 | 15a0aa75 |
15 | d07abd7 |
hex | 8d974bf |
148468927 has 4 divisors (see below), whose sum is σ = 148493800. Its totient is φ = 148444056.
The previous prime is 148468921. The next prime is 148468963. The reversal of 148468927 is 729864841.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 729864841 = 19 ⋅38413939.
It is a 3-Lehmer number, since φ(148468927) divides (148468927-1)3.
It is a cyclic number.
It is not a de Polignac number, because 148468927 - 27 = 148468799 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148468921) 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 3 ways as a sum of consecutive naturals, for example, 2488 + ... + 17410.
It is an arithmetic number, because the mean of its divisors is an integer number (37123450).
Almost surely, 2148468927 is an apocalyptic number.
148468927 is the 9949-th pentagonal number.
148468927 is a deficient number, since it is larger than the sum of its proper divisors (24873).
148468927 is an equidigital number, since it uses as much as digits as its factorization.
148468927 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24872.
The product of its digits is 774144, while the sum is 49.
The square root of 148468927 is about 12184.7825996199. The cubic root of 148468927 is about 529.5153121959.
The spelling of 148468927 in words is "one hundred forty-eight million, four hundred sixty-eight thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •