Base | Representation |
---|---|
bin | 110000101000000010… |
… | …0010110101110010101 |
3 | 100222112101102100102122 |
4 | 1201100010112232111 |
5 | 3202324132042122 |
6 | 115545425145325 |
7 | 10354454615513 |
oct | 1412004265625 |
9 | 328471370378 |
10 | 104422534037 |
11 | 40315886408 |
12 | 182a2a8b245 |
13 | 9b01b323a3 |
14 | 50a85634b3 |
15 | 2ab2625142 |
hex | 1850116b95 |
104422534037 has 2 divisors, whose sum is σ = 104422534038. Its totient is φ = 104422534036.
The previous prime is 104422534003. The next prime is 104422534063. The reversal of 104422534037 is 730435224401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66210494596 + 38212039441 = 257314^2 + 195479^2 .
It is a cyclic number.
It is not a de Polignac number, because 104422534037 - 222 = 104418339733 is a prime.
It is a super-2 number, since 2×1044225340372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104422533988 and 104422534006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104422594037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52211267018 + 52211267019.
It is an arithmetic number, because the mean of its divisors is an integer number (52211267019).
Almost surely, 2104422534037 is an apocalyptic number.
It is an amenable number.
104422534037 is a deficient number, since it is larger than the sum of its proper divisors (1).
104422534037 is an equidigital number, since it uses as much as digits as its factorization.
104422534037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80640, while the sum is 35.
Adding to 104422534037 its reverse (730435224401), we get a palindrome (834857758438).
The spelling of 104422534037 in words is "one hundred four billion, four hundred twenty-two million, five hundred thirty-four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •