Base | Representation |
---|---|
bin | 10100010101000101… |
… | …11110101011110101 |
3 | 1001011122021221022112 |
4 | 22022202332223311 |
5 | 134323034010203 |
6 | 5003004340405 |
7 | 534316346462 |
oct | 121242765365 |
9 | 31148257275 |
10 | 10914360053 |
11 | 46a0965283 |
12 | 2147244705 |
13 | 104c27111c |
14 | 75777a669 |
15 | 43d2c46d8 |
hex | 28a8beaf5 |
10914360053 has 2 divisors, whose sum is σ = 10914360054. Its totient is φ = 10914360052.
The previous prime is 10914360007. The next prime is 10914360089. The reversal of 10914360053 is 35006341901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8043757969 + 2870602084 = 89687^2 + 53578^2 .
It is a cyclic number.
It is not a de Polignac number, because 10914360053 - 226 = 10847251189 is a prime.
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 (10914366053) 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, 5457180026 + 5457180027.
It is an arithmetic number, because the mean of its divisors is an integer number (5457180027).
Almost surely, 210914360053 is an apocalyptic number.
It is an amenable number.
10914360053 is a deficient number, since it is larger than the sum of its proper divisors (1).
10914360053 is an equidigital number, since it uses as much as digits as its factorization.
10914360053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 32.
The spelling of 10914360053 in words is "ten billion, nine hundred fourteen million, three hundred sixty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •