Base | Representation |
---|---|
bin | 101111110010110101000011… |
… | …000101101110111100010010 |
3 | 1000120021000211110122101210010 |
4 | 233302311003011232330102 |
5 | 210022413343210310002 |
6 | 2023021021134215350 |
7 | 62163346464602322 |
oct | 5762650305567422 |
9 | 1016230743571703 |
10 | 210201120010002 |
11 | 60a8188134a670 |
12 | 1b6aa475954556 |
13 | 9039b5a7a2084 |
14 | 39c9b078a1282 |
15 | 1947c3094146c |
hex | bf2d4316ef12 |
210201120010002 has 16 divisors (see below), whose sum is σ = 458620625476512. Its totient is φ = 63697309093920.
The previous prime is 210201120009997. The next prime is 210201120010003. The reversal of 210201120010002 is 200010021102012.
It is a self number, because there is not a number n which added to its sum of digits gives 210201120010002.
It is not an unprimeable number, because it can be changed into a prime (210201120010003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1592432727283 + ... + 1592432727414.
It is an arithmetic number, because the mean of its divisors is an integer number (28663789092282).
Almost surely, 2210201120010002 is an apocalyptic number.
210201120010002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
210201120010002 is an abundant number, since it is smaller than the sum of its proper divisors (248419505466510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210201120010002 is a wasteful number, since it uses less digits than its factorization.
210201120010002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3184865454713.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 210201120010002 its reverse (200010021102012), we get a palindrome (410211141112014).
The spelling of 210201120010002 in words is "two hundred ten trillion, two hundred one billion, one hundred twenty million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •