Base | Representation |
---|---|
bin | 10001101010010… |
… | …00100111111001 |
3 | 101022202122001010 |
4 | 20311020213321 |
5 | 300411143211 |
6 | 22411144133 |
7 | 3446140344 |
oct | 1065104771 |
9 | 338678033 |
10 | 148146681 |
11 | 76696881 |
12 | 41745049 |
13 | 24900477 |
14 | 1596545b |
15 | d0154a6 |
hex | 8d489f9 |
148146681 has 8 divisors (see below), whose sum is σ = 197586880. Its totient is φ = 98735472.
The previous prime is 148146673. The next prime is 148146689. The reversal of 148146681 is 186641841.
148146681 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (148146673) and next prime (148146689).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 148146681 - 23 = 148146673 is a prime.
It is a super-2 number, since 2×1481466812 = 43894878182631522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (148146689) 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, 11931 + ... + 20943.
It is an arithmetic number, because the mean of its divisors is an integer number (24698360).
Almost surely, 2148146681 is an apocalyptic number.
It is an amenable number.
148146681 is a deficient number, since it is larger than the sum of its proper divisors (49440199).
148146681 is an equidigital number, since it uses as much as digits as its factorization.
148146681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14495.
The product of its digits is 36864, while the sum is 39.
The square root of 148146681 is about 12171.5521195943. The cubic root of 148146681 is about 529.1319372692.
The spelling of 148146681 in words is "one hundred forty-eight million, one hundred forty-six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •