Base | Representation |
---|---|
bin | 100011111100011010011… |
… | …010000110111011010101 |
3 | 22202010121222102122220222 |
4 | 203330122122012323111 |
5 | 310432130101400213 |
6 | 5130420331404125 |
7 | 343312060115552 |
oct | 43743232067325 |
9 | 8663558378828 |
10 | 2470049246933 |
11 | 8725a64511a4 |
12 | 33a8665b3645 |
13 | 14bc035a0748 |
14 | 877a0007a29 |
15 | 443b94b3808 |
hex | 23f1a686ed5 |
2470049246933 has 2 divisors, whose sum is σ = 2470049246934. Its totient is φ = 2470049246932.
The previous prime is 2470049246921. The next prime is 2470049246947. The reversal of 2470049246933 is 3396429400742.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2416927294609 + 53121952324 = 1554647^2 + 230482^2 .
It is a cyclic number.
It is not a de Polignac number, because 2470049246933 - 218 = 2470048984789 is a prime.
It is a super-2 number, since 2×24700492469332 (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 (2470049266933) 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, 1235024623466 + 1235024623467.
It is an arithmetic number, because the mean of its divisors is an integer number (1235024623467).
Almost surely, 22470049246933 is an apocalyptic number.
It is an amenable number.
2470049246933 is a deficient number, since it is larger than the sum of its proper divisors (1).
2470049246933 is an equidigital number, since it uses as much as digits as its factorization.
2470049246933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7838208, while the sum is 53.
The spelling of 2470049246933 in words is "two trillion, four hundred seventy billion, forty-nine million, two hundred forty-six thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •