Base | Representation |
---|---|
bin | 10000100110000010111… |
… | …001111010010101110101 |
3 | 11001000110211022220000202 |
4 | 100212002321322111311 |
5 | 122140430303141233 |
6 | 2231513023050245 |
7 | 145250150523200 |
oct | 20460271722565 |
9 | 4030424286022 |
10 | 1140362552693 |
11 | 3aa696a28261 |
12 | 165015140985 |
13 | 836c6cba450 |
14 | 3d29dc8c937 |
15 | 1e9e4200be8 |
hex | 10982e7a575 |
1140362552693 has 12 divisors (see below), whose sum is σ = 1428586055820. Its totient is φ = 902264876352.
The previous prime is 1140362552689. The next prime is 1140362552717. The reversal of 1140362552693 is 3962552630411.
It can be written as a sum of positive squares in 2 ways, for example, as 523795245169 + 616567307524 = 723737^2 + 785218^2 .
It is not a de Polignac number, because 1140362552693 - 22 = 1140362552689 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140362552633) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 895103408 + ... + 895104681.
It is an arithmetic number, because the mean of its divisors is an integer number (119048837985).
Almost surely, 21140362552693 is an apocalyptic number.
1140362552693 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1140362552693 is a deficient number, since it is larger than the sum of its proper divisors (288223503127).
1140362552693 is a wasteful number, since it uses less digits than its factorization.
1140362552693 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1790208116 (or 1790208109 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 47.
The spelling of 1140362552693 in words is "one trillion, one hundred forty billion, three hundred sixty-two million, five hundred fifty-two thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •