Base | Representation |
---|---|
bin | 111100100100011001000… |
… | …010011000011111101011 |
3 | 112201220110220012120221212 |
4 | 330210121002120133223 |
5 | 1021143233300133333 |
6 | 12504035212223335 |
7 | 606466161566444 |
oct | 74443102303753 |
9 | 15656426176855 |
10 | 4162243364843 |
11 | 1365219962a63 |
12 | 572806a6ab4b |
13 | 242661a6ac75 |
14 | 10564cb7c2cb |
15 | 7340987d448 |
hex | 3c9190987eb |
4162243364843 has 2 divisors, whose sum is σ = 4162243364844. Its totient is φ = 4162243364842.
The previous prime is 4162243364819. The next prime is 4162243364893. The reversal of 4162243364843 is 3484633422614.
It is a happy number.
4162243364843 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (4162243364893) can be obtained adding 4162243364843 to its sum of digits (50).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4162243364843 - 216 = 4162243299307 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4162243364791 and 4162243364800.
It is not a weakly prime, because it can be changed into another prime (4162243364893) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2081121682421 + 2081121682422.
It is an arithmetic number, because the mean of its divisors is an integer number (2081121682422).
Almost surely, 24162243364843 is an apocalyptic number.
4162243364843 is a deficient number, since it is larger than the sum of its proper divisors (1).
4162243364843 is an equidigital number, since it uses as much as digits as its factorization.
4162243364843 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7962624, while the sum is 50.
The spelling of 4162243364843 in words is "four trillion, one hundred sixty-two billion, two hundred forty-three million, three hundred sixty-four thousand, eight hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •