Base | Representation |
---|---|
bin | 1100100000111100011… |
… | …1101010101101101000 |
3 | 202112221212020220221021 |
4 | 3020033013222231220 |
5 | 12010311010024000 |
6 | 242434235422224 |
7 | 21350644061356 |
oct | 3101707525550 |
9 | 675855226837 |
10 | 215002033000 |
11 | 83200051687 |
12 | 358038b4974 |
13 | 173753ca691 |
14 | a5986b47d6 |
15 | 58d553b11a |
hex | 320f1eab68 |
215002033000 has 64 divisors (see below), whose sum is σ = 508086231120. Its totient is φ = 85149280000.
The previous prime is 215002032979. The next prime is 215002033019. The reversal of 215002033000 is 330200512.
215002033000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 14525552484 + 200476480516 = 120522^2 + 447746^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 963367 + ... + 1165366.
Almost surely, 2215002033000 is an apocalyptic number.
215002033000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
215002033000 is an abundant number, since it is smaller than the sum of its proper divisors (293084198120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215002033000 is a wasteful number, since it uses less digits than its factorization.
215002033000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2128855 (or 2128841 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 16.
Adding to 215002033000 its reverse (330200512), we get a palindrome (215332233512).
The spelling of 215002033000 in words is "two hundred fifteen billion, two million, thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •