Base | Representation |
---|---|
bin | 10001011010000011… |
… | …11101111010011101 |
3 | 220010022001210002211 |
4 | 20231001331322131 |
5 | 123114412100203 |
6 | 4143200520421 |
7 | 450405542116 |
oct | 105501757235 |
9 | 26108053084 |
10 | 9345425053 |
11 | 3a66281188 |
12 | 1989920111 |
13 | b5c1c4013 |
14 | 64925120d |
15 | 39a6aec6d |
hex | 22d07de9d |
9345425053 has 2 divisors, whose sum is σ = 9345425054. Its totient is φ = 9345425052.
The previous prime is 9345425051. The next prime is 9345425059. The reversal of 9345425053 is 3505245439.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6024553924 + 3320871129 = 77618^2 + 57627^2 .
It is a cyclic number.
It is not a de Polignac number, because 9345425053 - 21 = 9345425051 is a prime.
Together with 9345425051, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 9345424997 and 9345425015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (9345425051) 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, 4672712526 + 4672712527.
It is an arithmetic number, because the mean of its divisors is an integer number (4672712527).
Almost surely, 29345425053 is an apocalyptic number.
It is an amenable number.
9345425053 is a deficient number, since it is larger than the sum of its proper divisors (1).
9345425053 is an equidigital number, since it uses as much as digits as its factorization.
9345425053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 40.
The square root of 9345425053 is about 96671.7386468248. The cubic root of 9345425053 is about 2106.3620407745.
The spelling of 9345425053 in words is "nine billion, three hundred forty-five million, four hundred twenty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •