Base | Representation |
---|---|
bin | 1110110010010… |
… | …01010110010001 |
3 | 22122101111110122 |
4 | 13121021112101 |
5 | 223223014101 |
6 | 20150240025 |
7 | 3034154333 |
oct | 731112621 |
9 | 278344418 |
10 | 124032401 |
11 | 64016419 |
12 | 35656015 |
13 | 1c90946c |
14 | 12689453 |
15 | ad5051b |
hex | 7649591 |
124032401 has 2 divisors, whose sum is σ = 124032402. Its totient is φ = 124032400.
The previous prime is 124032397. The next prime is 124032413. The reversal of 124032401 is 104230421.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95570176 + 28462225 = 9776^2 + 5335^2 .
It is an emirp because it is prime and its reverse (104230421) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 124032401 - 22 = 124032397 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 124032401.
It is not a weakly prime, because it can be changed into another prime (124032451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62016200 + 62016201.
It is an arithmetic number, because the mean of its divisors is an integer number (62016201).
Almost surely, 2124032401 is an apocalyptic number.
It is an amenable number.
124032401 is a deficient number, since it is larger than the sum of its proper divisors (1).
124032401 is an equidigital number, since it uses as much as digits as its factorization.
124032401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 124032401 is about 11136.9834784829. The cubic root of 124032401 is about 498.7065247289.
Adding to 124032401 its reverse (104230421), we get a palindrome (228262822).
The spelling of 124032401 in words is "one hundred twenty-four million, thirty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •