Base | Representation |
---|---|
bin | 1011101001011011110… |
… | …0110110110001100010 |
3 | 201010111101101120222200 |
4 | 2322112330312301202 |
5 | 11234301330443020 |
6 | 231531455314030 |
7 | 20312455462026 |
oct | 2722674666142 |
9 | 633441346880 |
10 | 200101031010 |
11 | 779538a7301 |
12 | 3294551b916 |
13 | 15b3c23403a |
14 | 99836a0386 |
15 | 531227e590 |
hex | 2e96f36c62 |
200101031010 has 24 divisors (see below), whose sum is σ = 520262680860. Its totient is φ = 53360274912.
The previous prime is 200101030993. The next prime is 200101031017. The reversal of 200101031010 is 10130101002.
It can be written as a sum of positive squares in 2 ways, for example, as 197527802481 + 2573228529 = 444441^2 + 50727^2 .
It is a super-2 number, since 2×2001010310102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200101030983 and 200101031001.
It is not an unprimeable number, because it can be changed into a prime (200101031017) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1111672305 + ... + 1111672484.
Almost surely, 2200101031010 is an apocalyptic number.
200101031010 is an abundant number, since it is smaller than the sum of its proper divisors (320161649850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200101031010 is a wasteful number, since it uses less digits than its factorization.
200101031010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2223344802 (or 2223344799 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 200101031010 its reverse (10130101002), we get a palindrome (210231132012).
The spelling of 200101031010 in words is "two hundred billion, one hundred one million, thirty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •