Base | Representation |
---|---|
bin | 10000100101111001010… |
… | …010110010100101000100 |
3 | 11001000001120220112010110 |
4 | 100211321102302211010 |
5 | 122140113013133330 |
6 | 2231445022553020 |
7 | 145243152105432 |
oct | 20457122624504 |
9 | 4030046815113 |
10 | 1140201302340 |
11 | 3aa613a01501 |
12 | 164b8b138770 |
13 | 8369c77c839 |
14 | 3d2866b5d52 |
15 | 1e9d4e9cdb0 |
hex | 109794b2944 |
1140201302340 has 48 divisors (see below), whose sum is σ = 3360593315520. Its totient is φ = 288050855040.
The previous prime is 1140201302311. The next prime is 1140201302347. The reversal of 1140201302340 is 432031020411.
It is not an unprimeable number, because it can be changed into a prime (1140201302347) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 500087151 + ... + 500089430.
It is an arithmetic number, because the mean of its divisors is an integer number (70012360740).
Almost surely, 21140201302340 is an apocalyptic number.
1140201302340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1140201302340 is an abundant number, since it is smaller than the sum of its proper divisors (2220392013180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1140201302340 is a wasteful number, since it uses less digits than its factorization.
1140201302340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000176612 (or 1000176610 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1140201302340 its reverse (432031020411), we get a palindrome (1572232322751).
The spelling of 1140201302340 in words is "one trillion, one hundred forty billion, two hundred one million, three hundred two thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •