Base | Representation |
---|---|
bin | 110100101111001110… |
… | …1110101101110010101 |
3 | 101211022212102211200012 |
4 | 1221132131311232111 |
5 | 3323421012431404 |
6 | 124010030530005 |
7 | 11116353242024 |
oct | 1513635655625 |
9 | 354285384605 |
10 | 113254030229 |
11 | 44037a4719a |
12 | 19b48666905 |
13 | a8ab705392 |
14 | 56a54348bb |
15 | 2e2cb19a6e |
hex | 1a5e775b95 |
113254030229 has 2 divisors, whose sum is σ = 113254030230. Its totient is φ = 113254030228.
The previous prime is 113254030213. The next prime is 113254030247. The reversal of 113254030229 is 922030452311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78517644100 + 34736386129 = 280210^2 + 186377^2 .
It is a cyclic number.
It is not a de Polignac number, because 113254030229 - 24 = 113254030213 is a prime.
It is a super-2 number, since 2×1132540302292 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113254030195 and 113254030204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113254030249) 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, 56627015114 + 56627015115.
It is an arithmetic number, because the mean of its divisors is an integer number (56627015115).
Almost surely, 2113254030229 is an apocalyptic number.
It is an amenable number.
113254030229 is a deficient number, since it is larger than the sum of its proper divisors (1).
113254030229 is an equidigital number, since it uses as much as digits as its factorization.
113254030229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 113254030229 in words is "one hundred thirteen billion, two hundred fifty-four million, thirty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •