Base | Representation |
---|---|
bin | 110100110100100100… |
… | …0111100100001010101 |
3 | 101211210100101122112121 |
4 | 1221221020330201111 |
5 | 3324302333234141 |
6 | 124035505015541 |
7 | 11123656314262 |
oct | 1515110744125 |
9 | 354710348477 |
10 | 113433102421 |
11 | 4411a035841 |
12 | 19b986245b1 |
13 | a909842b62 |
14 | 56c112a269 |
15 | 2e3d6dd1d1 |
hex | 1a6923c855 |
113433102421 has 2 divisors, whose sum is σ = 113433102422. Its totient is φ = 113433102420.
The previous prime is 113433102379. The next prime is 113433102467. The reversal of 113433102421 is 124201334311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75762562500 + 37670539921 = 275250^2 + 194089^2 .
It is a cyclic number.
It is not a de Polignac number, because 113433102421 - 229 = 112896231509 is a prime.
It is a super-2 number, since 2×1134331024212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113433142421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56716551210 + 56716551211.
It is an arithmetic number, because the mean of its divisors is an integer number (56716551211).
Almost surely, 2113433102421 is an apocalyptic number.
It is an amenable number.
113433102421 is a deficient number, since it is larger than the sum of its proper divisors (1).
113433102421 is an equidigital number, since it uses as much as digits as its factorization.
113433102421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 113433102421 its reverse (124201334311), we get a palindrome (237634436732).
The spelling of 113433102421 in words is "one hundred thirteen billion, four hundred thirty-three million, one hundred two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •