Base | Representation |
---|---|
bin | 1010000110110111001111… |
… | …0111001100111001010001 |
3 | 1110100101122202201020100202 |
4 | 2201231303313030321101 |
5 | 2424033433201322304 |
6 | 35345130341224545 |
7 | 2224614046336466 |
oct | 241556367147121 |
9 | 43311582636322 |
10 | 11113024245329 |
11 | 35a500951a326 |
12 | 12b5941402155 |
13 | 627c52344026 |
14 | 2a5c3227366d |
15 | 14411e03481e |
hex | a1b73dcce51 |
11113024245329 has 2 divisors, whose sum is σ = 11113024245330. Its totient is φ = 11113024245328.
The previous prime is 11113024245307. The next prime is 11113024245361. The reversal of 11113024245329 is 92354242031111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6157271518225 + 4955752727104 = 2481385^2 + 2226152^2 .
It is an emirp because it is prime and its reverse (92354242031111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11113024245329 - 224 = 11113007468113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11113024245292 and 11113024245301.
It is not a weakly prime, because it can be changed into another prime (11113024245229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556512122664 + 5556512122665.
It is an arithmetic number, because the mean of its divisors is an integer number (5556512122665).
Almost surely, 211113024245329 is an apocalyptic number.
It is an amenable number.
11113024245329 is a deficient number, since it is larger than the sum of its proper divisors (1).
11113024245329 is an equidigital number, since it uses as much as digits as its factorization.
11113024245329 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 51840, while the sum is 38.
The spelling of 11113024245329 in words is "eleven trillion, one hundred thirteen billion, twenty-four million, two hundred forty-five thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •