Base | Representation |
---|---|
bin | 101101011110100010111101… |
… | …000111111000101001110010 |
3 | 222020011212220010020010001000 |
4 | 231132202331013320221302 |
5 | 202203440424230013020 |
6 | 1545215514214422430 |
7 | 60062222144620302 |
oct | 5536427507705162 |
9 | 866155803203030 |
10 | 200011210001010 |
11 | 58803306844aa1 |
12 | 1a523619661a16 |
13 | 877ac8c862985 |
14 | 375684675b602 |
15 | 181cb3d2b1090 |
hex | b5e8bd1f8a72 |
200011210001010 has 64 divisors (see below), whose sum is σ = 539789289701760. Its totient is φ = 52693716363840.
The previous prime is 200011210000939. The next prime is 200011210001041. The reversal of 200011210001010 is 10100012110002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 200011210000983 and 200011210001001.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4462521321 + ... + 4462566140.
It is an arithmetic number, because the mean of its divisors is an integer number (8434207651590).
Almost surely, 2200011210001010 is an apocalyptic number.
200011210001010 is an abundant number, since it is smaller than the sum of its proper divisors (339778079700750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200011210001010 is a wasteful number, since it uses less digits than its factorization.
200011210001010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8925087560 (or 8925087554 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 200011210001010 its reverse (10100012110002), we get a palindrome (210111222111012).
The spelling of 200011210001010 in words is "two hundred trillion, eleven billion, two hundred ten million, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •