Base | Representation |
---|---|
bin | 100100001111110101010… |
… | …010001011001111001001 |
3 | 22211010110012011000102211 |
4 | 210033311102023033021 |
5 | 311302331204400141 |
6 | 5144145414225121 |
7 | 344650566153463 |
oct | 44176522131711 |
9 | 8733405130384 |
10 | 2490901246921 |
11 | 8804268a843a |
12 | 3429059551a1 |
13 | 150b77636a89 |
14 | 887bb513133 |
15 | 44bd9e28d81 |
hex | 243f548b3c9 |
2490901246921 has 2 divisors, whose sum is σ = 2490901246922. Its totient is φ = 2490901246920.
The previous prime is 2490901246793. The next prime is 2490901246957. The reversal of 2490901246921 is 1296421090942.
2490901246921 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2425230009225 + 65671237696 = 1557315^2 + 256264^2 .
It is a cyclic number.
It is not a de Polignac number, because 2490901246921 - 27 = 2490901246793 is a prime.
It is a super-2 number, since 2×24909012469212 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2490901546921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1245450623460 + 1245450623461.
It is an arithmetic number, because the mean of its divisors is an integer number (1245450623461).
Almost surely, 22490901246921 is an apocalyptic number.
It is an amenable number.
2490901246921 is a deficient number, since it is larger than the sum of its proper divisors (1).
2490901246921 is an equidigital number, since it uses as much as digits as its factorization.
2490901246921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 559872, while the sum is 49.
The spelling of 2490901246921 in words is "two trillion, four hundred ninety billion, nine hundred one million, two hundred forty-six thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •