Base | Representation |
---|---|
bin | 110000101000000001… |
… | …1100010101100100001 |
3 | 100222112101000112002202 |
4 | 1201100003202230201 |
5 | 3202324103232204 |
6 | 115545420422545 |
7 | 10354453040303 |
oct | 1412003425441 |
9 | 328471015082 |
10 | 104422320929 |
11 | 40315750293 |
12 | 182a29a7a55 |
13 | 9b01a893a4 |
14 | 50a8509973 |
15 | 2ab25d1e1e |
hex | 18500e2b21 |
104422320929 has 2 divisors, whose sum is σ = 104422320930. Its totient is φ = 104422320928.
The previous prime is 104422320917. The next prime is 104422320979. The reversal of 104422320929 is 929023224401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104101731904 + 320589025 = 322648^2 + 17905^2 .
It is a cyclic number.
It is not a de Polignac number, because 104422320929 - 224 = 104405543713 is a prime.
It is a super-2 number, since 2×1044223209292 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104422320892 and 104422320901.
It is not a weakly prime, because it can be changed into another prime (104422320979) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52211160464 + 52211160465.
It is an arithmetic number, because the mean of its divisors is an integer number (52211160465).
Almost surely, 2104422320929 is an apocalyptic number.
It is an amenable number.
104422320929 is a deficient number, since it is larger than the sum of its proper divisors (1).
104422320929 is an equidigital number, since it uses as much as digits as its factorization.
104422320929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 38.
The spelling of 104422320929 in words is "one hundred four billion, four hundred twenty-two million, three hundred twenty thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •