Base | Representation |
---|---|
bin | 1000010001110001… |
… | …11001111100010111 |
3 | 102110201100210110001 |
4 | 10020320321330113 |
5 | 33100142234143 |
6 | 2012552312131 |
7 | 215062150555 |
oct | 41070717427 |
9 | 12421323401 |
10 | 4444102423 |
11 | 1980641a22 |
12 | a403a2647 |
13 | 55a934c07 |
14 | 302318bd5 |
15 | 1b024b14d |
hex | 108e39f17 |
4444102423 has 2 divisors, whose sum is σ = 4444102424. Its totient is φ = 4444102422.
The previous prime is 4444102393. The next prime is 4444102471. The reversal of 4444102423 is 3242014444.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4444102423 is a prime.
It is a super-2 number, since 2×44441024232 = 39500092692228941858, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4444102391 and 4444102400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4444103423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2222051211 + 2222051212.
It is an arithmetic number, because the mean of its divisors is an integer number (2222051212).
Almost surely, 24444102423 is an apocalyptic number.
4444102423 is a deficient number, since it is larger than the sum of its proper divisors (1).
4444102423 is an equidigital number, since it uses as much as digits as its factorization.
4444102423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12288, while the sum is 28.
The square root of 4444102423 is about 66664.1014564811. The cubic root of 4444102423 is about 1644.0992069343.
Adding to 4444102423 its reverse (3242014444), we get a palindrome (7686116867).
The spelling of 4444102423 in words is "four billion, four hundred forty-four million, one hundred two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •