Base | Representation |
---|---|
bin | 11101000111000010010… |
… | …11001100011111010010 |
3 | 10112121201100222202111101 |
4 | 32203201023030133102 |
5 | 112341412304033020 |
6 | 2043253520135014 |
7 | 132156066413200 |
oct | 16434113143722 |
9 | 3477640882441 |
10 | 1000210221010 |
11 | 35620665a070 |
12 | 141a2046746a |
13 | 7341c9c1180 |
14 | 365a632a070 |
15 | 1b03ee3e00a |
hex | e8e12cc7d2 |
1000210221010 has 192 divisors, whose sum is σ = 2488118290560. Its totient is φ = 284537594880.
The previous prime is 1000210221007. The next prime is 1000210221019. The reversal of 1000210221010 is 101220120001.
1000210221010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (1000210221019) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 6156037 + ... + 6316423.
It is an arithmetic number, because the mean of its divisors is an integer number (12958949430).
Almost surely, 21000210221010 is an apocalyptic number.
1000210221010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1000210221010 is an abundant number, since it is smaller than the sum of its proper divisors (1487908069550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000210221010 is a wasteful number, since it uses less digits than its factorization.
1000210221010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160521 (or 160514 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1000210221010 its reverse (101220120001), we get a palindrome (1101430341011).
The spelling of 1000210221010 in words is "one trillion, two hundred ten million, two hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •