Base | Representation |
---|---|
bin | 11011111111111… |
… | …001001010100101 |
3 | 1012201212221222112 |
4 | 123333321022211 |
5 | 1430222442203 |
6 | 114340010405 |
7 | 14432450015 |
oct | 3377711245 |
9 | 1181787875 |
10 | 469734053 |
11 | 221175168 |
12 | 111390a05 |
13 | 76419059 |
14 | 46557c45 |
15 | 2b38a6d8 |
hex | 1bff92a5 |
469734053 has 2 divisors, whose sum is σ = 469734054. Its totient is φ = 469734052.
The previous prime is 469734047. The next prime is 469734059. The reversal of 469734053 is 350437964.
It is a balanced prime because it is at equal distance from previous prime (469734047) and next prime (469734059).
It can be written as a sum of positive squares in only one way, i.e., 310393924 + 159340129 = 17618^2 + 12623^2 .
It is a cyclic number.
It is not a de Polignac number, because 469734053 - 26 = 469733989 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 469734053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (469734059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 234867026 + 234867027.
It is an arithmetic number, because the mean of its divisors is an integer number (234867027).
Almost surely, 2469734053 is an apocalyptic number.
It is an amenable number.
469734053 is a deficient number, since it is larger than the sum of its proper divisors (1).
469734053 is an equidigital number, since it uses as much as digits as its factorization.
469734053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 272160, while the sum is 41.
The square root of 469734053 is about 21673.3489105860. The cubic root of 469734053 is about 777.3513343612.
The spelling of 469734053 in words is "four hundred sixty-nine million, seven hundred thirty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •