Base | Representation |
---|---|
bin | 11011111101010… |
… | …000101100111101 |
3 | 1012200120220110002 |
4 | 123331100230331 |
5 | 1430033402104 |
6 | 114313124045 |
7 | 14423544206 |
oct | 3375205475 |
9 | 1180526402 |
10 | 469044029 |
11 | 2208437a3 |
12 | 1110b9625 |
13 | 76236c5c |
14 | 464185ad |
15 | 2b2a101e |
hex | 1bf50b3d |
469044029 has 2 divisors, whose sum is σ = 469044030. Its totient is φ = 469044028.
The previous prime is 469043969. The next prime is 469044031. The reversal of 469044029 is 920440964.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 410872900 + 58171129 = 20270^2 + 7627^2 .
It is a cyclic number.
It is not a de Polignac number, because 469044029 - 212 = 469039933 is a prime.
It is a super-2 number, since 2×4690440292 = 440004602281105682, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 469044031, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 469043983 and 469044001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (469244029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 234522014 + 234522015.
It is an arithmetic number, because the mean of its divisors is an integer number (234522015).
Almost surely, 2469044029 is an apocalyptic number.
It is an amenable number.
469044029 is a deficient number, since it is larger than the sum of its proper divisors (1).
469044029 is an equidigital number, since it uses as much as digits as its factorization.
469044029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 62208, while the sum is 38.
The square root of 469044029 is about 21657.4243390113. The cubic root of 469044029 is about 776.9705132453.
The spelling of 469044029 in words is "four hundred sixty-nine million, forty-four thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •