Base | Representation |
---|---|
bin | 10000100101111111111… |
… | …001000101011101000101 |
3 | 11001000100022012202211112 |
4 | 100211333321011131011 |
5 | 122140324333120141 |
6 | 2231504015414405 |
7 | 145245665053142 |
oct | 20457771053505 |
9 | 4030308182745 |
10 | 1140312004421 |
11 | 3aa670442627 |
12 | 165000224405 |
13 | 836b969c625 |
14 | 3d2972913c9 |
15 | 1e9dea687eb |
hex | 1097fe45745 |
1140312004421 has 8 divisors (see below), whose sum is σ = 1142902129824. Its totient is φ = 1137723882640.
The previous prime is 1140312004309. The next prime is 1140312004439. The reversal of 1140312004421 is 1244002130411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1140312004421 is a prime.
It is a super-2 number, since 2×11403120044212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140312004451) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 641591 + ... + 1640811.
It is an arithmetic number, because the mean of its divisors is an integer number (142862766228).
Almost surely, 21140312004421 is an apocalyptic number.
It is an amenable number.
1140312004421 is a deficient number, since it is larger than the sum of its proper divisors (2590125403).
1140312004421 is an equidigital number, since it uses as much as digits as its factorization.
1140312004421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1001811.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 1140312004421 its reverse (1244002130411), we get a palindrome (2384314134832).
The spelling of 1140312004421 in words is "one trillion, one hundred forty billion, three hundred twelve million, four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •