Base | Representation |
---|---|
bin | 11001100111101… |
… | …110111001010001 |
3 | 1002221211102222211 |
4 | 121213232321101 |
5 | 1340020033342 |
6 | 110353032121 |
7 | 13436426422 |
oct | 3147567121 |
9 | 1087742884 |
10 | 429846097 |
11 | 20070080a |
12 | bbb55641 |
13 | 6b091505 |
14 | 41133649 |
15 | 27b0bc17 |
hex | 199eee51 |
429846097 has 2 divisors, whose sum is σ = 429846098. Its totient is φ = 429846096.
The previous prime is 429846083. The next prime is 429846191. The reversal of 429846097 is 790648924.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 399640081 + 30206016 = 19991^2 + 5496^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-429846097 is a prime.
It is a super-2 number, since 2×4298460972 = 369535334212266818, which contains 22 as substring.
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 429846097.
It is not a weakly prime, because it can be changed into another prime (429846047) 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 as a sum of consecutive naturals, namely, 214923048 + 214923049.
It is an arithmetic number, because the mean of its divisors is an integer number (214923049).
Almost surely, 2429846097 is an apocalyptic number.
It is an amenable number.
429846097 is a deficient number, since it is larger than the sum of its proper divisors (1).
429846097 is an equidigital number, since it uses as much as digits as its factorization.
429846097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 870912, while the sum is 49.
The square root of 429846097 is about 20732.7300903668. The cubic root of 429846097 is about 754.6941714139.
The spelling of 429846097 in words is "four hundred twenty-nine million, eight hundred forty-six thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •