Base | Representation |
---|---|
bin | 10001110110001… |
… | …00011100000001 |
3 | 101102200200002101 |
4 | 20323010130001 |
5 | 301310434101 |
6 | 22504350401 |
7 | 3465310102 |
oct | 1073043401 |
9 | 342620071 |
10 | 149702401 |
11 | 775596a2 |
12 | 42175401 |
13 | 25026604 |
14 | 15c4c3a9 |
15 | d221401 |
hex | 8ec4701 |
149702401 has 2 divisors, whose sum is σ = 149702402. Its totient is φ = 149702400.
The previous prime is 149702359. The next prime is 149702419. The reversal of 149702401 is 104207941.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 123743376 + 25959025 = 11124^2 + 5095^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-149702401 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 149702401.
It is not a weakly prime, because it can be changed into another prime (149702461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 74851200 + 74851201.
It is an arithmetic number, because the mean of its divisors is an integer number (74851201).
Almost surely, 2149702401 is an apocalyptic number.
It is an amenable number.
149702401 is a deficient number, since it is larger than the sum of its proper divisors (1).
149702401 is an equidigital number, since it uses as much as digits as its factorization.
149702401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 28.
The square root of 149702401 is about 12235.2932535350. The cubic root of 149702401 is about 530.9776673671.
It can be divided in two parts, 14970 and 2401, that added together give a palindrome (17371).
The spelling of 149702401 in words is "one hundred forty-nine million, seven hundred two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •