Base | Representation |
---|---|
bin | 11001110000110000001011… |
… | …000100111110000001000011 |
3 | 112212011111202222121002120011 |
4 | 121300300023010332001003 |
5 | 104322312303304323301 |
6 | 1040545542154525351 |
7 | 32602520613155446 |
oct | 3160601304760103 |
9 | 485144688532504 |
10 | 113301423120451 |
11 | 33112955653675 |
12 | 1085a6a9436857 |
13 | 4b2b380715267 |
14 | 1dd9b64d8965d |
15 | d1736b525a51 |
hex | 670c0b13e043 |
113301423120451 has 2 divisors, whose sum is σ = 113301423120452. Its totient is φ = 113301423120450.
The previous prime is 113301423120439. The next prime is 113301423120533. The reversal of 113301423120451 is 154021324103311.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 113301423120451 - 233 = 113292833185859 is a prime.
It is a super-2 number, since 2×1133014231204512 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (113301423120421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56650711560225 + 56650711560226.
It is an arithmetic number, because the mean of its divisors is an integer number (56650711560226).
Almost surely, 2113301423120451 is an apocalyptic number.
113301423120451 is a deficient number, since it is larger than the sum of its proper divisors (1).
113301423120451 is an equidigital number, since it uses as much as digits as its factorization.
113301423120451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 113301423120451 its reverse (154021324103311), we get a palindrome (267322747223762).
The spelling of 113301423120451 in words is "one hundred thirteen trillion, three hundred one billion, four hundred twenty-three million, one hundred twenty thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •