Base | Representation |
---|---|
bin | 1010000001001000110001… |
… | …0111011100111111000111 |
3 | 1102222222201222021221100012 |
4 | 2200102030113130333013 |
5 | 2420431001140331343 |
6 | 35232021051340435 |
7 | 2214532215420653 |
oct | 240221427347707 |
9 | 42888658257305 |
10 | 11014651105223 |
11 | 3567318441137 |
12 | 129a86845171b |
13 | 61b8a58b2c9c |
14 | 2a117d2d9a63 |
15 | 1417b2a52718 |
hex | a048c5dcfc7 |
11014651105223 has 2 divisors, whose sum is σ = 11014651105224. Its totient is φ = 11014651105222.
The previous prime is 11014651105207. The next prime is 11014651105273. The reversal of 11014651105223 is 32250115641011.
11014651105223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11014651105223 - 24 = 11014651105207 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11014651105223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11014651105273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5507325552611 + 5507325552612.
It is an arithmetic number, because the mean of its divisors is an integer number (5507325552612).
Almost surely, 211014651105223 is an apocalyptic number.
11014651105223 is a deficient number, since it is larger than the sum of its proper divisors (1).
11014651105223 is an equidigital number, since it uses as much as digits as its factorization.
11014651105223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7200, while the sum is 32.
Adding to 11014651105223 its reverse (32250115641011), we get a palindrome (43264766746234).
The spelling of 11014651105223 in words is "eleven trillion, fourteen billion, six hundred fifty-one million, one hundred five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •