Base | Representation |
---|---|
bin | 110001000010000111011100… |
… | …101110110111001001000000 |
3 | 1001021112220121111201000002021 |
4 | 301002013130232313021000 |
5 | 211231201104324034424 |
6 | 2042352040104531224 |
7 | 63265115000432260 |
oct | 6102073456671100 |
9 | 1037486544630067 |
10 | 215649716236864 |
11 | 62792592925a88 |
12 | 2022a439780b14 |
13 | 93438b11743a0 |
14 | 3b377055257a0 |
15 | 19de8260634e4 |
hex | c421dcbb7240 |
215649716236864 has 112 divisors (see below), whose sum is σ = 544844442643200. Its totient is φ = 82370183325696.
The previous prime is 215649716236819. The next prime is 215649716236897. The reversal of 215649716236864 is 468632617946512.
It is a tau number, because it is divible by the number of its divisors (112).
It is a super-2 number, since 2×2156497162368642 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 215649716236793 and 215649716236802.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 638240884 + ... + 638578675.
It is an arithmetic number, because the mean of its divisors is an integer number (4864682523600).
Almost surely, 2215649716236864 is an apocalyptic number.
It is an amenable number.
215649716236864 is an abundant number, since it is smaller than the sum of its proper divisors (329194726406336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215649716236864 is a wasteful number, since it uses less digits than its factorization.
215649716236864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1276819620 (or 1276819610 counting only the distinct ones).
The product of its digits is 627056640, while the sum is 70.
The spelling of 215649716236864 in words is "two hundred fifteen trillion, six hundred forty-nine billion, seven hundred sixteen million, two hundred thirty-six thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •