Base | Representation |
---|---|
bin | 10101010110011000… |
… | …01010100110101101 |
3 | 1002120210211100002012 |
4 | 22223030022212231 |
5 | 141433234341233 |
6 | 5133211011005 |
7 | 554016425234 |
oct | 125314124655 |
9 | 32523740065 |
10 | 11462027693 |
11 | 495201a066 |
12 | 227a739a65 |
13 | 1108875b0c |
14 | 7aa3bdb1b |
15 | 471406548 |
hex | 2ab30a9ad |
11462027693 has 2 divisors, whose sum is σ = 11462027694. Its totient is φ = 11462027692.
The previous prime is 11462027641. The next prime is 11462027737. The reversal of 11462027693 is 39672026411.
11462027693 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., 6208967209 + 5253060484 = 78797^2 + 72478^2 .
It is a cyclic number.
It is not a de Polignac number, because 11462027693 - 228 = 11193592237 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11462027693.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11462027293) 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, 5731013846 + 5731013847.
It is an arithmetic number, because the mean of its divisors is an integer number (5731013847).
Almost surely, 211462027693 is an apocalyptic number.
It is an amenable number.
11462027693 is a deficient number, since it is larger than the sum of its proper divisors (1).
11462027693 is an equidigital number, since it uses as much as digits as its factorization.
11462027693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864, while the sum is 41.
The spelling of 11462027693 in words is "eleven billion, four hundred sixty-two million, twenty-seven thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •