Base | Representation |
---|---|
bin | 110001000111110… |
… | …0111010010010001 |
3 | 11020212111021222121 |
4 | 1202033213102101 |
5 | 11333423311431 |
6 | 431315534241 |
7 | 55562660305 |
oct | 14217472221 |
9 | 4225437877 |
10 | 1648260241 |
11 | 776444351 |
12 | 39bbba381 |
13 | 203632324 |
14 | 118c97d05 |
15 | 99a83611 |
hex | 623e7491 |
1648260241 has 4 divisors (see below), whose sum is σ = 1735010800. Its totient is φ = 1561509684.
The previous prime is 1648260227. The next prime is 1648260253. The reversal of 1648260241 is 1420628461.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1648260241 - 27 = 1648260113 is a prime.
It is a super-2 number, since 2×16482602412 = 5433523644122756162, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1648260197 and 1648260206.
It is not an unprimeable number, because it can be changed into a prime (1648260221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43375251 + ... + 43375288.
It is an arithmetic number, because the mean of its divisors is an integer number (433752700).
Almost surely, 21648260241 is an apocalyptic number.
It is an amenable number.
1648260241 is a deficient number, since it is larger than the sum of its proper divisors (86750559).
1648260241 is an equidigital number, since it uses as much as digits as its factorization.
1648260241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86750558.
The product of its (nonzero) digits is 18432, while the sum is 34.
The square root of 1648260241 is about 40598.7714222980. The cubic root of 1648260241 is about 1181.2502885286.
The spelling of 1648260241 in words is "one billion, six hundred forty-eight million, two hundred sixty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •