Base | Representation |
---|---|
bin | 10000000001101010110… |
… | …010101110011010110000 |
3 | 10220021122201110202221111 |
4 | 100001222302232122300 |
5 | 121020432121410000 |
6 | 2201533132003104 |
7 | 142365215452105 |
oct | 20015262563260 |
9 | 3807581422844 |
10 | 1101303310000 |
11 | 39507300a0a3 |
12 | 159534300494 |
13 | 7cb10b01a1a |
14 | 3b43660aaac |
15 | 1d9aa0e6cba |
hex | 1006acae6b0 |
1101303310000 has 50 divisors (see below), whose sum is σ = 2666365468052. Its totient is φ = 440521320000.
The previous prime is 1101303309989. The next prime is 1101303310021. The reversal of 1101303310000 is 133031011.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (50).
It is a super-2 number, since 2×11013033100002 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 55055166 + ... + 55075165.
Almost surely, 21101303310000 is an apocalyptic number.
1101303310000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101303310000 is an abundant number, since it is smaller than the sum of its proper divisors (1565062158052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101303310000 is an equidigital number, since it uses as much as digits as its factorization.
1101303310000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110130359 (or 110130338 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 1101303310000 its reverse (133031011), we get a palindrome (1101436341011).
The spelling of 1101303310000 in words is "one trillion, one hundred one billion, three hundred three million, three hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •