Base | Representation |
---|---|
bin | 10000100101111111111… |
… | …101011000110110010001 |
3 | 11001000100101100002011202 |
4 | 100211333331120312101 |
5 | 122140330130214213 |
6 | 2231504055520545 |
7 | 145246010461616 |
oct | 20457775306621 |
9 | 4030311302152 |
10 | 1140313132433 |
11 | 3aa671043072 |
12 | 165000689155 |
13 | 836b99a5ba7 |
14 | 3d2974a650d |
15 | 1e9debdcb58 |
hex | 1097ff58d91 |
1140313132433 has 16 divisors (see below), whose sum is σ = 1159832681280. Its totient is φ = 1120966511616.
The previous prime is 1140313132423. The next prime is 1140313132457. The reversal of 1140313132433 is 3342313130411.
It is a cyclic number.
It is not a de Polignac number, because 1140313132433 - 212 = 1140313128337 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1140313132396 and 1140313132405.
It is not an unprimeable number, because it can be changed into a prime (1140313132403) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 15294341 + ... + 15368717.
It is an arithmetic number, because the mean of its divisors is an integer number (72489542580).
Almost surely, 21140313132433 is an apocalyptic number.
It is an amenable number.
1140313132433 is a deficient number, since it is larger than the sum of its proper divisors (19519548847).
1140313132433 is an equidigital number, since it uses as much as digits as its factorization.
1140313132433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75536.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 1140313132433 its reverse (3342313130411), we get a palindrome (4482626262844).
The spelling of 1140313132433 in words is "one trillion, one hundred forty billion, three hundred thirteen million, one hundred thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •