Base | Representation |
---|---|
bin | 10000000010010101100… |
… | …101010001000001011010 |
3 | 10220100111202022110122110 |
4 | 100002111211101001122 |
5 | 121023414411431020 |
6 | 2202132254533150 |
7 | 142422053442531 |
oct | 20022545210132 |
9 | 3810452273573 |
10 | 1102021202010 |
11 | 395401269a83 |
12 | 1596b48071b6 |
13 | 7cbc6766bb1 |
14 | 3b4a3ac1318 |
15 | 1d9ed1508e0 |
hex | 1009595105a |
1102021202010 has 64 divisors (see below), whose sum is σ = 2687425464960. Its totient is φ = 289177516800.
The previous prime is 1102021201991. The next prime is 1102021202011. The reversal of 1102021202010 is 102021202011.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1102021202011) 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, 621765 + ... + 1609544.
It is an arithmetic number, because the mean of its divisors is an integer number (41991022890).
Almost surely, 21102021202010 is an apocalyptic number.
1102021202010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1102021202010 is an abundant number, since it is smaller than the sum of its proper divisors (1585404262950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102021202010 is a wasteful number, since it uses less digits than its factorization.
1102021202010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2231583.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1102021202010 its reverse (102021202011), we get a palindrome (1204042404021).
Subtracting from 1102021202010 its reverse (102021202011), we obtain a palindrome (999999999999).
It can be divided in two parts, 1102021 and 202010, that added together give a palindrome (1304031).
The spelling of 1102021202010 in words is "one trillion, one hundred two billion, twenty-one million, two hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •