Base | Representation |
---|---|
bin | 11001100110011… |
… | …010101001110001 |
3 | 1002221011220122222 |
4 | 121212122221301 |
5 | 1334423013131 |
6 | 110341410425 |
7 | 13433461424 |
oct | 3146325161 |
9 | 1087156588 |
10 | 429501041 |
11 | 200495542 |
12 | bba09a15 |
13 | 6aca0438 |
14 | 410839bb |
15 | 27a8e87b |
hex | 1999aa71 |
429501041 has 2 divisors, whose sum is σ = 429501042. Its totient is φ = 429501040.
The previous prime is 429501031. The next prime is 429501047. The reversal of 429501041 is 140105924.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 380445025 + 49056016 = 19505^2 + 7004^2 .
It is a cyclic number.
It is not a de Polignac number, because 429501041 - 218 = 429238897 is a prime.
It is a super-2 number, since 2×4295010412 = 368942288440167362, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 429501041.
It is not a weakly prime, because it can be changed into another prime (429501047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 214750520 + 214750521.
It is an arithmetic number, because the mean of its divisors is an integer number (214750521).
Almost surely, 2429501041 is an apocalyptic number.
It is an amenable number.
429501041 is a deficient number, since it is larger than the sum of its proper divisors (1).
429501041 is an equidigital number, since it uses as much as digits as its factorization.
429501041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 26.
The square root of 429501041 is about 20724.4068913926. The cubic root of 429501041 is about 754.4921755010.
Adding to 429501041 its reverse (140105924), we get a palindrome (569606965).
The spelling of 429501041 in words is "four hundred twenty-nine million, five hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •