Base | Representation |
---|---|
bin | 10000000001101011010… |
… | …111101110111000001010 |
3 | 10220021200101201122111120 |
4 | 100001223113232320022 |
5 | 121020442112324320 |
6 | 2201534115540110 |
7 | 142365364065366 |
oct | 20015327567012 |
9 | 3807611648446 |
10 | 1101313011210 |
11 | 395078535825 |
12 | 1595375ba636 |
13 | 7cb12b1a599 |
14 | 3b437a142a6 |
15 | 1d9aadb1440 |
hex | 1006b5eee0a |
1101313011210 has 64 divisors (see below), whose sum is σ = 2683086336000. Its totient is φ = 289247821632.
The previous prime is 1101313011193. The next prime is 1101313011247. The reversal of 1101313011210 is 121103131011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1101313011210.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11770191 + ... + 11863389.
It is an arithmetic number, because the mean of its divisors is an integer number (41923224000).
Almost surely, 21101313011210 is an apocalyptic number.
1101313011210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1101313011210 is an abundant number, since it is smaller than the sum of its proper divisors (1581773324790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101313011210 is a wasteful number, since it uses less digits than its factorization.
1101313011210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99155.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 1101313011210 its reverse (121103131011), we get a palindrome (1222416142221).
The spelling of 1101313011210 in words is "one trillion, one hundred one billion, three hundred thirteen million, eleven thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •