Base | Representation |
---|---|
bin | 110100100111111111… |
… | …1100100001111110001 |
3 | 101210200221112110110111 |
4 | 1221033333210033301 |
5 | 3322421332311142 |
6 | 123525554301321 |
7 | 11110344314653 |
oct | 1511777441761 |
9 | 353627473414 |
10 | 113011213297 |
11 | 43a2297a244 |
12 | 19a9b287841 |
13 | a870309318 |
14 | 56810a86d3 |
15 | 2e16653e17 |
hex | 1a4ffe43f1 |
113011213297 has 2 divisors, whose sum is σ = 113011213298. Its totient is φ = 113011213296.
The previous prime is 113011213283. The next prime is 113011213313. The reversal of 113011213297 is 792312110311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 76574511841 + 36436701456 = 276721^2 + 190884^2 .
It is an emirp because it is prime and its reverse (792312110311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113011213297 is a prime.
It is a super-2 number, since 2×1130112132972 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (113011210297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56505606648 + 56505606649.
It is an arithmetic number, because the mean of its divisors is an integer number (56505606649).
Almost surely, 2113011213297 is an apocalyptic number.
It is an amenable number.
113011213297 is a deficient number, since it is larger than the sum of its proper divisors (1).
113011213297 is an equidigital number, since it uses as much as digits as its factorization.
113011213297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 31.
The spelling of 113011213297 in words is "one hundred thirteen billion, eleven million, two hundred thirteen thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •