Base | Representation |
---|---|
bin | 1001111101110100… |
… | …10110001111001001 |
3 | 111210212211000202022 |
4 | 10332322112033021 |
5 | 41424203400441 |
6 | 2242530414225 |
7 | 246406034642 |
oct | 47672261711 |
9 | 14725730668 |
10 | 5350450121 |
11 | 22a620a405 |
12 | 1053a31375 |
13 | 673641923 |
14 | 38a8486c9 |
15 | 214acd84b |
hex | 13ee963c9 |
5350450121 has 2 divisors, whose sum is σ = 5350450122. Its totient is φ = 5350450120.
The previous prime is 5350450099. The next prime is 5350450123. The reversal of 5350450121 is 1210540535.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2866424521 + 2484025600 = 53539^2 + 49840^2 .
It is a cyclic number.
It is not a de Polignac number, because 5350450121 - 226 = 5283341257 is a prime.
Together with 5350450123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (5350450123) 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, 2675225060 + 2675225061.
It is an arithmetic number, because the mean of its divisors is an integer number (2675225061).
Almost surely, 25350450121 is an apocalyptic number.
It is an amenable number.
5350450121 is a deficient number, since it is larger than the sum of its proper divisors (1).
5350450121 is an equidigital number, since it uses as much as digits as its factorization.
5350450121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 5350450121 is about 73146.7710907324. The cubic root of 5350450121 is about 1749.0280448719.
Adding to 5350450121 its reverse (1210540535), we get a palindrome (6560990656).
The spelling of 5350450121 in words is "five billion, three hundred fifty million, four hundred fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •