Base | Representation |
---|---|
bin | 11001100100000110000000… |
… | …000000101100110001111111 |
3 | 112202002100101000010211002021 |
4 | 121210012000000230301333 |
5 | 104214034211140340323 |
6 | 1035042153204141011 |
7 | 32452623354424066 |
oct | 3144060000546177 |
9 | 482070330124067 |
10 | 112431506574463 |
11 | 32907a3041806a |
12 | 10739b90097767 |
13 | 4a973266c081b |
14 | 1da99dd1331dd |
15 | cee90510a05d |
hex | 66418002cc7f |
112431506574463 has 2 divisors, whose sum is σ = 112431506574464. Its totient is φ = 112431506574462.
The previous prime is 112431506574461. The next prime is 112431506574479. The reversal of 112431506574463 is 364475605134211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112431506574463 - 21 = 112431506574461 is a prime.
Together with 112431506574461, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 112431506574463.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112431506574461) 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, 56215753287231 + 56215753287232.
It is an arithmetic number, because the mean of its divisors is an integer number (56215753287232).
Almost surely, 2112431506574463 is an apocalyptic number.
112431506574463 is a deficient number, since it is larger than the sum of its proper divisors (1).
112431506574463 is an equidigital number, since it uses as much as digits as its factorization.
112431506574463 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7257600, while the sum is 52.
The spelling of 112431506574463 in words is "one hundred twelve trillion, four hundred thirty-one billion, five hundred six million, five hundred seventy-four thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •