Base | Representation |
---|---|
bin | 10000100110000111001… |
… | …011101100101100001001 |
3 | 11001000122211101021001221 |
4 | 100212013023230230021 |
5 | 122141102141333413 |
6 | 2231524105242041 |
7 | 145252011545521 |
oct | 20460713545411 |
9 | 4030584337057 |
10 | 1140434324233 |
11 | 3aa723499286 |
12 | 165035193321 |
13 | 83708b29409 |
14 | 3d2a9612681 |
15 | 1e9ea67b68d |
hex | 109872ecb09 |
1140434324233 has 4 divisors (see below), whose sum is σ = 1152191379220. Its totient is φ = 1128677269248.
The previous prime is 1140434324231. The next prime is 1140434324257. The reversal of 1140434324233 is 3324234340411.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 514875132304 + 625559191929 = 717548^2 + 790923^2 .
It is a cyclic number.
It is not a de Polignac number, because 1140434324233 - 21 = 1140434324231 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1140434324231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5878527348 + ... + 5878527541.
It is an arithmetic number, because the mean of its divisors is an integer number (288047844805).
Almost surely, 21140434324233 is an apocalyptic number.
It is an amenable number.
1140434324233 is a deficient number, since it is larger than the sum of its proper divisors (11757054987).
1140434324233 is an equidigital number, since it uses as much as digits as its factorization.
1140434324233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11757054986.
The product of its (nonzero) digits is 82944, while the sum is 34.
Adding to 1140434324233 its reverse (3324234340411), we get a palindrome (4464668664644).
The spelling of 1140434324233 in words is "one trillion, one hundred forty billion, four hundred thirty-four million, three hundred twenty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •