Base | Representation |
---|---|
bin | 11101000110100101101… |
… | …001101010110101101100 |
3 | 21002012012011222112020100 |
4 | 131012211221222311230 |
5 | 230231333333103102 |
6 | 4130432000351100 |
7 | 264330231434100 |
oct | 35064551526554 |
9 | 7065164875210 |
10 | 1999938956652 |
11 | 70119544803a |
12 | 283727615490 |
13 | 116793a10550 |
14 | 6cb2471d900 |
15 | 37052970a1c |
hex | 1d1a5a6ad6c |
1999938956652 has 648 divisors, whose sum is σ = 6598323609696. Its totient is φ = 506217600000.
The previous prime is 1999938956651. The next prime is 1999938956657. The reversal of 1999938956652 is 2566598399991.
1999938956652 is a `hidden beast` number, since 1 + 99 + 99 + 389 + 5 + 6 + 65 + 2 = 666.
It is not an unprimeable number, because it can be changed into a prime (1999938956651) by changing a digit.
It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 3327685152 + ... + 3327685752.
Almost surely, 21999938956652 is an apocalyptic number.
1999938956652 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1999938956652, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3299161804848).
1999938956652 is an abundant number, since it is smaller than the sum of its proper divisors (4598384653044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1999938956652 is a wasteful number, since it uses less digits than its factorization.
1999938956652 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 851 (or 808 counting only the distinct ones).
The product of its digits is 2550916800, while the sum is 81.
The spelling of 1999938956652 in words is "one trillion, nine hundred ninety-nine billion, nine hundred thirty-eight million, nine hundred fifty-six thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •