Base | Representation |
---|---|
bin | 100010000100101… |
… | …1111110001011001 |
3 | 2221200101200210102 |
4 | 1010021133301121 |
5 | 4320143340441 |
6 | 305241425145 |
7 | 40222142060 |
oct | 10411376131 |
9 | 2850350712 |
10 | 1143340121 |
11 | 5374273a0 |
12 | 27aa9b1b5 |
13 | 152b46921 |
14 | abbc11d7 |
15 | 6a59769b |
hex | 4425fc59 |
1143340121 has 8 divisors (see below), whose sum is σ = 1425463104. Its totient is φ = 890914320.
The previous prime is 1143340111. The next prime is 1143340123. The reversal of 1143340121 is 1210433411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1143340121 - 230 = 69598297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1143340093 and 1143340102.
It is not an unprimeable number, because it can be changed into a prime (1143340123) 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, 7424210 + ... + 7424363.
It is an arithmetic number, because the mean of its divisors is an integer number (178182888).
Almost surely, 21143340121 is an apocalyptic number.
1143340121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1143340121 is a deficient number, since it is larger than the sum of its proper divisors (282122983).
1143340121 is a wasteful number, since it uses less digits than its factorization.
1143340121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14848591.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 1143340121 is about 33813.3127776620. The cubic root of 1143340121 is about 1045.6631767968.
Adding to 1143340121 its reverse (1210433411), we get a palindrome (2353773532).
The spelling of 1143340121 in words is "one billion, one hundred forty-three million, three hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •