Base | Representation |
---|---|
bin | 10000100101110100011… |
… | …110101101001111110110 |
3 | 11000222211221221101020020 |
4 | 100211310132231033312 |
5 | 122134431324241100 |
6 | 2231433015550010 |
7 | 145241151456234 |
oct | 20456436551766 |
9 | 4028757841206 |
10 | 1140120540150 |
11 | 3aa58235a699 |
12 | 164b6808b306 |
13 | 83688b13567 |
14 | 3d279a91954 |
15 | 1e9ccd485a0 |
hex | 109747ad3f6 |
1140120540150 has 48 divisors (see below), whose sum is σ = 2861565223104. Its totient is φ = 300369102880.
The previous prime is 1140120540137. The next prime is 1140120540191. The reversal of 1140120540150 is 510450210411.
It is a self number, because there is not a number n which added to its sum of digits gives 1140120540150.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 45775524 + ... + 45800423.
It is an arithmetic number, because the mean of its divisors is an integer number (59615942148).
Almost surely, 21140120540150 is an apocalyptic number.
1140120540150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1140120540150 is an abundant number, since it is smaller than the sum of its proper divisors (1721444682954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1140120540150 is a wasteful number, since it uses less digits than its factorization.
1140120540150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91576045 (or 91576040 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 24.
Adding to 1140120540150 its reverse (510450210411), we get a palindrome (1650570750561).
The spelling of 1140120540150 in words is "one trillion, one hundred forty billion, one hundred twenty million, five hundred forty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •