Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …101001000000000110100 |
3 | 10220021011022121110210010 |
4 | 100001133111020000310 |
5 | 121020033404014030 |
6 | 2201502102100220 |
7 | 142360362036633 |
oct | 20013725100064 |
9 | 3807138543703 |
10 | 1101111001140 |
11 | 394a844aa657 |
12 | 15949ba1a670 |
13 | 7cab000b3b7 |
14 | 3b418c6b51a |
15 | 1d9982ab6b0 |
hex | 1005f548034 |
1101111001140 has 48 divisors (see below), whose sum is σ = 3111924940992. Its totient is φ = 290885396736.
The previous prime is 1101111001139. The next prime is 1101111001147. The reversal of 1101111001140 is 411001111011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101111001147) 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, 85749889 + ... + 85762728.
It is an arithmetic number, because the mean of its divisors is an integer number (64831769604).
Almost surely, 21101111001140 is an apocalyptic number.
1101111001140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101111001140 is an abundant number, since it is smaller than the sum of its proper divisors (2010813939852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101111001140 is a wasteful number, since it uses less digits than its factorization.
1101111001140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171512736 (or 171512734 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1101111001140 its reverse (411001111011), we get a palindrome (1512112112151).
The spelling of 1101111001140 in words is "one trillion, one hundred one billion, one hundred eleven million, one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •