Base | Representation |
---|---|
bin | 10000000110001010111… |
… | …00111010100101111101 |
3 | 1221212120021222010001002 |
4 | 20003011130322211331 |
5 | 33030141014133334 |
6 | 1102024241300045 |
7 | 54646360505234 |
oct | 10030534724575 |
9 | 1855507863032 |
10 | 553068505469 |
11 | 1a3611831087 |
12 | 8b231634625 |
13 | 402008394bc |
14 | 1caa92adb1b |
15 | e5bea9eb7e |
hex | 80c573a97d |
553068505469 has 2 divisors, whose sum is σ = 553068505470. Its totient is φ = 553068505468.
The previous prime is 553068505447. The next prime is 553068505487. The reversal of 553068505469 is 964505860355.
553068505469 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., 549915682969 + 3152822500 = 741563^2 + 56150^2 .
It is a cyclic number.
It is not a de Polignac number, because 553068505469 - 212 = 553068501373 is a prime.
It is a super-2 number, since 2×5530685054692 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (553068505499) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276534252734 + 276534252735.
It is an arithmetic number, because the mean of its divisors is an integer number (276534252735).
Almost surely, 2553068505469 is an apocalyptic number.
It is an amenable number.
553068505469 is a deficient number, since it is larger than the sum of its proper divisors (1).
553068505469 is an equidigital number, since it uses as much as digits as its factorization.
553068505469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 19440000, while the sum is 56.
The spelling of 553068505469 in words is "five hundred fifty-three billion, sixty-eight million, five hundred five thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •