Base | Representation |
---|---|
bin | 10000100101101111010… |
… | …101001000001100100100 |
3 | 11000222121221100221122020 |
4 | 100211233111020030210 |
5 | 122134242220034022 |
6 | 2231420252103140 |
7 | 145236052220442 |
oct | 20455725101444 |
9 | 4028557327566 |
10 | 1140034143012 |
11 | 3aa53860a1a6 |
12 | 164b43164ab0 |
13 | 83673c534ab |
14 | 3d26c401b92 |
15 | 1e9c547e35c |
hex | 1096f548324 |
1140034143012 has 24 divisors (see below), whose sum is σ = 2716677108096. Its totient is φ = 371926032288.
The previous prime is 1140034142999. The next prime is 1140034143041. The reversal of 1140034143012 is 2103414300411.
It is a super-3 number, since 3×11400341430123 (a number of 37 digits) contains 333 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 7 ways as a sum of consecutive naturals, for example, 1010668003 + ... + 1010669130.
It is an arithmetic number, because the mean of its divisors is an integer number (113194879504).
Almost surely, 21140034143012 is an apocalyptic number.
1140034143012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1140034143012 is an abundant number, since it is smaller than the sum of its proper divisors (1576642965084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1140034143012 is a wasteful number, since it uses less digits than its factorization.
1140034143012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2021337187 (or 2021337185 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 1140034143012 its reverse (2103414300411), we get a palindrome (3243448443423).
The spelling of 1140034143012 in words is "one trillion, one hundred forty billion, thirty-four million, one hundred forty-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •