Base | Representation |
---|---|
bin | 100110101011101000001… |
… | …000000011001010100101 |
3 | 100102010020102120011220222 |
4 | 212223220020003022211 |
5 | 322022430124310112 |
6 | 5353053012534125 |
7 | 363022166002424 |
oct | 46535010031245 |
9 | 10363212504828 |
10 | 2658184213157 |
11 | 935369764960 |
12 | 36b210621345 |
13 | 1638866c2175 |
14 | 9292a3a12bb |
15 | 4922ae77372 |
hex | 26ae82032a5 |
2658184213157 has 16 divisors (see below), whose sum is σ = 3029831941248. Its totient is φ = 2308474111680.
The previous prime is 2658184213007. The next prime is 2658184213159. The reversal of 2658184213157 is 7513124818562.
It is not a de Polignac number, because 2658184213157 - 240 = 1558672585381 is a prime.
It is a super-2 number, since 2×26581842131572 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2658184213099 and 2658184213108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2658184213159) 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 in 15 ways as a sum of consecutive naturals, for example, 6600458 + ... + 6991595.
It is an arithmetic number, because the mean of its divisors is an integer number (189364496328).
Almost surely, 22658184213157 is an apocalyptic number.
It is an amenable number.
2658184213157 is a deficient number, since it is larger than the sum of its proper divisors (371647728091).
2658184213157 is a wasteful number, since it uses less digits than its factorization.
2658184213157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13592860.
The product of its digits is 3225600, while the sum is 53.
The spelling of 2658184213157 in words is "two trillion, six hundred fifty-eight billion, one hundred eighty-four million, two hundred thirteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •