Base | Representation |
---|---|
bin | 10000000001011001111… |
… | …110100111001000011010 |
3 | 10220020221001122202220020 |
4 | 100001121332213020122 |
5 | 121014342412310320 |
6 | 2201445133411310 |
7 | 142355221616352 |
oct | 20013176471032 |
9 | 3806831582806 |
10 | 1101021213210 |
11 | 394a38853656 |
12 | 159475939b36 |
13 | 7ca97531b49 |
14 | 3b40ad77b62 |
15 | 1d990472940 |
hex | 10059fa721a |
1101021213210 has 32 divisors (see below), whose sum is σ = 2642541363072. Its totient is φ = 293595606720.
The previous prime is 1101021213209. The next prime is 1101021213217. The reversal of 1101021213210 is 123121201011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1101021213210.
It is not an unprimeable number, because it can be changed into a prime (1101021213217) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 284640 + ... + 1510980.
It is an arithmetic number, because the mean of its divisors is an integer number (82579417596).
Almost surely, 21101021213210 is an apocalyptic number.
1101021213210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1101021213210 is an abundant number, since it is smaller than the sum of its proper divisors (1541520149862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101021213210 is a wasteful number, since it uses less digits than its factorization.
1101021213210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1256278.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1101021213210 its reverse (123121201011), we get a palindrome (1224142414221).
The spelling of 1101021213210 in words is "one trillion, one hundred one billion, twenty-one million, two hundred thirteen thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.295 sec. • engine limits •