Base | Representation |
---|---|
bin | 10010101100001111… |
… | …01100100001111001 |
3 | 221220100020021120001 |
4 | 21112013230201321 |
5 | 131022401330234 |
6 | 4335424233001 |
7 | 503446221004 |
oct | 112607544171 |
9 | 27810207501 |
10 | 10034792569 |
11 | 428a4191aa |
12 | 1b4076b761 |
13 | c3bc7c9a9 |
14 | 6b2a1c53b |
15 | 3dae81d14 |
hex | 2561ec879 |
10034792569 has 2 divisors, whose sum is σ = 10034792570. Its totient is φ = 10034792568.
The previous prime is 10034792497. The next prime is 10034792587. The reversal of 10034792569 is 96529743001.
It is a happy number.
10034792569 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9816846400 + 217946169 = 99080^2 + 14763^2 .
It is a cyclic number.
It is not a de Polignac number, because 10034792569 - 29 = 10034792057 is a prime.
It is a super-2 number, since 2×100347925692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10034192569) 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, 5017396284 + 5017396285.
It is an arithmetic number, because the mean of its divisors is an integer number (5017396285).
Almost surely, 210034792569 is an apocalyptic number.
It is an amenable number.
10034792569 is a deficient number, since it is larger than the sum of its proper divisors (1).
10034792569 is an equidigital number, since it uses as much as digits as its factorization.
10034792569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 408240, while the sum is 46.
The spelling of 10034792569 in words is "ten billion, thirty-four million, seven hundred ninety-two thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •