Base | Representation |
---|---|
bin | 110100001011001111… |
… | …0100100000110011111 |
3 | 101201012200210210021011 |
4 | 1220112132210012133 |
5 | 3313432320320024 |
6 | 123250124120051 |
7 | 11044416333625 |
oct | 1502636440637 |
9 | 351180723234 |
10 | 112046260639 |
11 | 43578214005 |
12 | 19870096027 |
13 | a748420611 |
14 | 55ccc81515 |
15 | 2daba97094 |
hex | 1a167a419f |
112046260639 has 2 divisors, whose sum is σ = 112046260640. Its totient is φ = 112046260638.
The previous prime is 112046260597. The next prime is 112046260679. The reversal of 112046260639 is 936062640211.
It is an a-pointer prime, because the next prime (112046260679) can be obtained adding 112046260639 to its sum of digits (40).
It is a strong prime.
It is an emirp because it is prime and its reverse (936062640211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112046260639 - 215 = 112046227871 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112046260679) 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, 56023130319 + 56023130320.
It is an arithmetic number, because the mean of its divisors is an integer number (56023130320).
Almost surely, 2112046260639 is an apocalyptic number.
112046260639 is a deficient number, since it is larger than the sum of its proper divisors (1).
112046260639 is an equidigital number, since it uses as much as digits as its factorization.
112046260639 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 93312, while the sum is 40.
The spelling of 112046260639 in words is "one hundred twelve billion, forty-six million, two hundred sixty thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •