Base | Representation |
---|---|
bin | 1001101111100001… |
… | …00110100010111001 |
3 | 111111112000122100102 |
4 | 10313300212202321 |
5 | 41202444024334 |
6 | 2223002445145 |
7 | 243421063565 |
oct | 46760464271 |
9 | 14445018312 |
10 | 5230454969 |
11 | 2244501263 |
12 | 101b8037b5 |
13 | 654819c8c |
14 | 3789306a5 |
15 | 2092c967e |
hex | 137c268b9 |
5230454969 has 2 divisors, whose sum is σ = 5230454970. Its totient is φ = 5230454968.
The previous prime is 5230454917. The next prime is 5230455089. The reversal of 5230454969 is 9694540325.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3313153600 + 1917301369 = 57560^2 + 43787^2 .
It is a cyclic number.
It is not a de Polignac number, because 5230454969 - 216 = 5230389433 is a prime.
It is a super-2 number, since 2×52304549692 = 54715318365473581922, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5230454069) 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, 2615227484 + 2615227485.
It is an arithmetic number, because the mean of its divisors is an integer number (2615227485).
Almost surely, 25230454969 is an apocalyptic number.
It is an amenable number.
5230454969 is a deficient number, since it is larger than the sum of its proper divisors (1).
5230454969 is an equidigital number, since it uses as much as digits as its factorization.
5230454969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1166400, while the sum is 47.
The square root of 5230454969 is about 72321.8844403269. The cubic root of 5230454969 is about 1735.8538452180.
The spelling of 5230454969 in words is "five billion, two hundred thirty million, four hundred fifty-four thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •