Base | Representation |
---|---|
bin | 100011110100011011100… |
… | …101101000011011101101 |
3 | 22201022111201012121201002 |
4 | 203310123211220123231 |
5 | 310312102123013011 |
6 | 5122442103530045 |
7 | 342556514135654 |
oct | 43643345503355 |
9 | 8638451177632 |
10 | 2461479110381 |
11 | 8699a8872815 |
12 | 339074459925 |
13 | 14b168bb9825 |
14 | 871c9b2c19b |
15 | 44066de8c3b |
hex | 23d1b9686ed |
2461479110381 has 2 divisors, whose sum is σ = 2461479110382. Its totient is φ = 2461479110380.
The previous prime is 2461479110359. The next prime is 2461479110477. The reversal of 2461479110381 is 1830119741642.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2147616975625 + 313862134756 = 1465475^2 + 560234^2 .
It is a cyclic number.
It is not a de Polignac number, because 2461479110381 - 222 = 2461474916077 is a prime.
It is a super-2 number, since 2×24614791103812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2461479110351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1230739555190 + 1230739555191.
It is an arithmetic number, because the mean of its divisors is an integer number (1230739555191).
Almost surely, 22461479110381 is an apocalyptic number.
It is an amenable number.
2461479110381 is a deficient number, since it is larger than the sum of its proper divisors (1).
2461479110381 is an equidigital number, since it uses as much as digits as its factorization.
2461479110381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 290304, while the sum is 47.
The spelling of 2461479110381 in words is "two trillion, four hundred sixty-one billion, four hundred seventy-nine million, one hundred ten thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •