Base | Representation |
---|---|
bin | 101100001000010… |
… | …1111111011101001 |
3 | 10211012100201000122 |
4 | 1120100233323221 |
5 | 11013040120031 |
6 | 402534213025 |
7 | 51460320206 |
oct | 13020577351 |
9 | 3735321018 |
10 | 1480785641 |
11 | 69a957195 |
12 | 353ab4175 |
13 | 1a7a2562a |
14 | 100940cad |
15 | 8a00147b |
hex | 5842fee9 |
1480785641 has 2 divisors, whose sum is σ = 1480785642. Its totient is φ = 1480785640.
The previous prime is 1480785613. The next prime is 1480785659. The reversal of 1480785641 is 1465870841.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 914155225 + 566630416 = 30235^2 + 23804^2 .
It is a cyclic number.
It is not a de Polignac number, because 1480785641 - 230 = 407043817 is a prime.
It is a super-2 number, since 2×14807856412 = 4385452229183561762, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1480785592 and 1480785601.
It is not a weakly prime, because it can be changed into another prime (1480785611) 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, 740392820 + 740392821.
It is an arithmetic number, because the mean of its divisors is an integer number (740392821).
Almost surely, 21480785641 is an apocalyptic number.
It is an amenable number.
1480785641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1480785641 is an equidigital number, since it uses as much as digits as its factorization.
1480785641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 215040, while the sum is 44.
The square root of 1480785641 is about 38480.9776513019. The cubic root of 1480785641 is about 1139.8054559273.
The spelling of 1480785641 in words is "one billion, four hundred eighty million, seven hundred eighty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •