Base | Representation |
---|---|
bin | 11101000111000001001… |
… | …01000011000101010010 |
3 | 10112121200200011201002000 |
4 | 32203200211003011102 |
5 | 112341402224033020 |
6 | 2043252521534430 |
7 | 132155615413524 |
oct | 16434045030522 |
9 | 3477620151060 |
10 | 1000200221010 |
11 | 356200a49a01 |
12 | 141a19044416 |
13 | 7341a8cc603 |
14 | 365a4c85a14 |
15 | 1b03e116090 |
hex | e8e0943152 |
1000200221010 has 64 divisors (see below), whose sum is σ = 2667499205760. Its totient is φ = 266690197440.
The previous prime is 1000200221003. The next prime is 1000200221011. The reversal of 1000200221010 is 101220020001.
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 = 1000200220983 and 1000200221001.
It is not an unprimeable number, because it can be changed into a prime (1000200221011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2263105 + ... + 2668715.
It is an arithmetic number, because the mean of its divisors is an integer number (41679675090).
Almost surely, 21000200221010 is an apocalyptic number.
1000200221010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1000200221010 is an abundant number, since it is smaller than the sum of its proper divisors (1667298984750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000200221010 is a wasteful number, since it uses less digits than its factorization.
1000200221010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 414760 (or 414754 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1000200221010 its reverse (101220020001), we get a palindrome (1101420241011).
The spelling of 1000200221010 in words is "one trillion, two hundred million, two hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •