Base | Representation |
---|---|
bin | 1011110000110111100… |
… | …1011011000111100000 |
3 | 201022122110110000110000 |
4 | 2330031321123013200 |
5 | 11302343213320000 |
6 | 232501503540000 |
7 | 20413066632522 |
oct | 2741571330740 |
9 | 638573400400 |
10 | 202096620000 |
11 | 78788300900 |
12 | 332018ba600 |
13 | 160997c5722 |
14 | 9ad272ba12 |
15 | 53cc570000 |
hex | 2f0de5b1e0 |
202096620000 has 900 divisors, whose sum is σ = 817162243128. Its totient is φ = 48945600000.
The previous prime is 202096619993. The next prime is 202096620001. The reversal of 202096620000 is 26690202.
It is a tau number, because it is divible by the number of its divisors (900).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202096620001) by changing a digit.
It is a polite number, since it can be written in 149 ways as a sum of consecutive naturals, for example, 196019485 + ... + 196020515.
Almost surely, 2202096620000 is an apocalyptic number.
202096620000 is a gapful number since it is divisible by the number (20) 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 202096620000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (408581121564).
202096620000 is an abundant number, since it is smaller than the sum of its proper divisors (615065623128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202096620000 is a wasteful number, since it uses less digits than its factorization.
202096620000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1095 (or 1052 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The spelling of 202096620000 in words is "two hundred two billion, ninety-six million, six hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •