Base | Representation |
---|---|
bin | 1010000110101100000001… |
… | …0101001101000000001101 |
3 | 1110100002212212001001022122 |
4 | 2201223000111031000031 |
5 | 2424011301111224323 |
6 | 35343511423022325 |
7 | 2224446313433066 |
oct | 241530025150015 |
9 | 43302785031278 |
10 | 11110012211213 |
11 | 35a380328a533 |
12 | 12b524073a9a5 |
13 | 627892308116 |
14 | 2a5a2821756d |
15 | 143ee48b4ec8 |
hex | a1ac054d00d |
11110012211213 has 2 divisors, whose sum is σ = 11110012211214. Its totient is φ = 11110012211212.
The previous prime is 11110012211189. The next prime is 11110012211269. The reversal of 11110012211213 is 31211221001111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10630612453444 + 479399757769 = 3260462^2 + 692387^2 .
It is a cyclic number.
It is not a de Polignac number, because 11110012211213 - 212 = 11110012207117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11110012211191 and 11110012211200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11110012211113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555006105606 + 5555006105607.
It is an arithmetic number, because the mean of its divisors is an integer number (5555006105607).
Almost surely, 211110012211213 is an apocalyptic number.
It is an amenable number.
11110012211213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110012211213 is an equidigital number, since it uses as much as digits as its factorization.
11110012211213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 11110012211213 its reverse (31211221001111), we get a palindrome (42321233212324).
The spelling of 11110012211213 in words is "eleven trillion, one hundred ten billion, twelve million, two hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •