Base | Representation |
---|---|
bin | 1100101010111111111100… |
… | …0100000100000011110111 |
3 | 1211022222010211202221000000 |
4 | 3022233333010010003313 |
5 | 3311233443144234330 |
6 | 45344400001122343 |
7 | 2635421133421350 |
oct | 312577704040367 |
9 | 54288124687000 |
10 | 13932858196215 |
11 | 449198a24a752 |
12 | 16903460293b3 |
13 | 7a0b2aa0177a |
14 | 3624d52a8d27 |
15 | 19265b6c0560 |
hex | cabff1040f7 |
13932858196215 has 224 divisors, whose sum is σ = 30602546257536. Its totient is φ = 5941570682880.
The previous prime is 13932858196163. The next prime is 13932858196219. The reversal of 13932858196215 is 51269185823931.
13932858196215 is a `hidden beast` number, since 1 + 3 + 9 + 3 + 28 + 581 + 9 + 6 + 21 + 5 = 666.
It is not a de Polignac number, because 13932858196215 - 27 = 13932858196087 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13932858196219) by changing a digit.
It is a polite number, since it can be written in 223 ways as a sum of consecutive naturals, for example, 48872185 + ... + 49156445.
Almost surely, 213932858196215 is an apocalyptic number.
13932858196215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13932858196215 is an abundant number, since it is smaller than the sum of its proper divisors (16669688061321).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13932858196215 is a wasteful number, since it uses less digits than its factorization.
13932858196215 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 284421 (or 284406 counting only the distinct ones).
The product of its digits is 27993600, while the sum is 63.
The spelling of 13932858196215 in words is "thirteen trillion, nine hundred thirty-two billion, eight hundred fifty-eight million, one hundred ninety-six thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •