Base | Representation |
---|---|
bin | 10000100110000000011… |
… | …000000001010111010100 |
3 | 11001000100212110210021012 |
4 | 100212000120001113110 |
5 | 122140333422123012 |
6 | 2231504505311352 |
7 | 145246124020463 |
oct | 20460030012724 |
9 | 4030325423235 |
10 | 1140320114132 |
11 | 3aa674a81571 |
12 | 165002a95558 |
13 | 836bb27b984 |
14 | 3d2983a29da |
15 | 1e9e061b622 |
hex | 109806015d4 |
1140320114132 has 24 divisors (see below), whose sum is σ = 2030986480320. Its totient is φ = 560085672960.
The previous prime is 1140320114083. The next prime is 1140320114137. The reversal of 1140320114132 is 2314110230411.
It is a super-2 number, since 2×11403201141322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1140320114098 and 1140320114107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140320114137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5829869 + ... + 6022292.
It is an arithmetic number, because the mean of its divisors is an integer number (84624436680).
Almost surely, 21140320114132 is an apocalyptic number.
It is an amenable number.
1140320114132 is a deficient number, since it is larger than the sum of its proper divisors (890666366188).
1140320114132 is a wasteful number, since it uses less digits than its factorization.
1140320114132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11852591 (or 11852589 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1140320114132 its reverse (2314110230411), we get a palindrome (3454430344543).
The spelling of 1140320114132 in words is "one trillion, one hundred forty billion, three hundred twenty million, one hundred fourteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •