Base | Representation |
---|---|
bin | 11001100010011001111010… |
… | …101101111110111011101111 |
3 | 112201200020211002010011220111 |
4 | 121202121322231332323233 |
5 | 104210134022114240012 |
6 | 1034513001311400451 |
7 | 32441344434112225 |
oct | 3142317255767357 |
9 | 481606732104814 |
10 | 112315453665007 |
11 | 3287279759954a |
12 | 1071b5a2223127 |
13 | 4a893c01913b8 |
14 | 1da41500cab15 |
15 | ceb8b1927ba7 |
hex | 66267ab7eeef |
112315453665007 has 2 divisors, whose sum is σ = 112315453665008. Its totient is φ = 112315453665006.
The previous prime is 112315453664993. The next prime is 112315453665053. The reversal of 112315453665007 is 700566354513211.
It is a weak prime.
It is an emirp because it is prime and its reverse (700566354513211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112315453665007 is a prime.
It is a super-2 number, since 2×1123154536650072 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112315453665067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56157726832503 + 56157726832504.
It is an arithmetic number, because the mean of its divisors is an integer number (56157726832504).
Almost surely, 2112315453665007 is an apocalyptic number.
112315453665007 is a deficient number, since it is larger than the sum of its proper divisors (1).
112315453665007 is an equidigital number, since it uses as much as digits as its factorization.
112315453665007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268000, while the sum is 49.
The spelling of 112315453665007 in words is "one hundred twelve trillion, three hundred fifteen billion, four hundred fifty-three million, six hundred sixty-five thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •