Base | Representation |
---|---|
bin | 10001110100011… |
… | …00110110001101 |
3 | 101102021002202001 |
4 | 20322030312031 |
5 | 301231142301 |
6 | 22455432301 |
7 | 3463341205 |
oct | 1072146615 |
9 | 342232661 |
10 | 149474701 |
11 | 77413612 |
12 | 42085691 |
13 | 24c76a8c |
14 | 15bcd405 |
15 | d1c8c01 |
hex | 8e8cd8d |
149474701 has 2 divisors, whose sum is σ = 149474702. Its totient is φ = 149474700.
The previous prime is 149474683. The next prime is 149474713. The reversal of 149474701 is 107474941.
149474701 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87048900 + 62425801 = 9330^2 + 7901^2 .
It is a cyclic number.
It is not a de Polignac number, because 149474701 - 213 = 149466509 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is equal to p8416495 and since 149474701 and 8416495 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (149474791) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74737350 + 74737351.
It is an arithmetic number, because the mean of its divisors is an integer number (74737351).
Almost surely, 2149474701 is an apocalyptic number.
It is an amenable number.
149474701 is a deficient number, since it is larger than the sum of its proper divisors (1).
149474701 is an equidigital number, since it uses as much as digits as its factorization.
149474701 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28224, while the sum is 37.
The square root of 149474701 is about 12225.9846638216. The cubic root of 149474701 is about 530.7083219531.
The spelling of 149474701 in words is "one hundred forty-nine million, four hundred seventy-four thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •