Base | Representation |
---|---|
bin | 100000001100010010000… |
… | …1110100110101100000001 |
3 | 120122222012201120002012012 |
4 | 1000120210032212230001 |
5 | 1034442210033420022 |
6 | 13224315151542305 |
7 | 634440232350164 |
oct | 100304416465401 |
9 | 16588181502165 |
10 | 4424424123137 |
11 | 145642a0891a7 |
12 | 5b559682a995 |
13 | 2612b556c735 |
14 | 1142011c1adb |
15 | 7a151c20de2 |
hex | 406243a6b01 |
4424424123137 has 32 divisors (see below), whose sum is σ = 4686100176384. Its totient is φ = 4172749056000.
The previous prime is 4424424123121. The next prime is 4424424123139. The reversal of 4424424123137 is 7313214244244.
It is a cyclic number.
It is not a de Polignac number, because 4424424123137 - 24 = 4424424123121 is a prime.
It is a super-2 number, since 2×44244241231372 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4424424123094 and 4424424123103.
It is not an unprimeable number, because it can be changed into a prime (4424424123139) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 57319433 + ... + 57396569.
It is an arithmetic number, because the mean of its divisors is an integer number (146440630512).
Almost surely, 24424424123137 is an apocalyptic number.
4424424123137 is a gapful number since it is divisible by the number (47) formed by its first and last digit.
It is an amenable number.
4424424123137 is a deficient number, since it is larger than the sum of its proper divisors (261676053247).
4424424123137 is a wasteful number, since it uses less digits than its factorization.
4424424123137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77609.
The product of its digits is 516096, while the sum is 41.
The spelling of 4424424123137 in words is "four trillion, four hundred twenty-four billion, four hundred twenty-four million, one hundred twenty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •