Base | Representation |
---|---|
bin | 10000000001100101010… |
… | …011000011000110000010 |
3 | 10220021102022000001001010 |
4 | 100001211103003012002 |
5 | 121020240021320002 |
6 | 2201520040021350 |
7 | 142363016035440 |
oct | 20014523030602 |
9 | 3807368001033 |
10 | 1101211120002 |
11 | 395025a72414 |
12 | 159509461856 |
13 | 7cac7994026 |
14 | 3b42828db90 |
15 | 1d9a1e8646c |
hex | 100654c3182 |
1101211120002 has 64 divisors (see below), whose sum is σ = 2665262880000. Its totient is φ = 296107677696.
The previous prime is 1101211119977. The next prime is 1101211120003. The reversal of 1101211120002 is 2000211121011.
It is a self number, because there is not a number n which added to its sum of digits gives 1101211120002.
It is not an unprimeable number, because it can be changed into a prime (1101211120003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18712408 + ... + 18771164.
It is an arithmetic number, because the mean of its divisors is an integer number (41644732500).
Almost surely, 21101211120002 is an apocalyptic number.
1101211120002 is an abundant number, since it is smaller than the sum of its proper divisors (1564051759998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101211120002 is a wasteful number, since it uses less digits than its factorization.
1101211120002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85035.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1101211120002 its reverse (2000211121011), we get a palindrome (3101422241013).
The spelling of 1101211120002 in words is "one trillion, one hundred one billion, two hundred eleven million, one hundred twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •