Base | Representation |
---|---|
bin | 10000010111000010000… |
… | …011101011110101011111 |
3 | 10222110212101001122021200 |
4 | 100113002003223311133 |
5 | 121404422001211033 |
6 | 2220245244130543 |
7 | 144136525054023 |
oct | 20270203536537 |
9 | 3873771048250 |
10 | 1124242210143 |
11 | 3a3874467308 |
12 | 161a76536a53 |
13 | 8202831a410 |
14 | 3c5b0d52383 |
15 | 1e39dd88013 |
hex | 105c20ebd5f |
1124242210143 has 12 divisors (see below), whose sum is σ = 1748821215960. Its totient is φ = 691841360016.
The previous prime is 1124242210061. The next prime is 1124242210159. The reversal of 1124242210143 is 3410122424211.
1124242210143 is a `hidden beast` number, since 1 + 1 + 2 + 424 + 221 + 0 + 14 + 3 = 666.
It is not a de Polignac number, because 1124242210143 - 214 = 1124242193759 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1124242210193) 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, 4804453773 + ... + 4804454006.
It is an arithmetic number, because the mean of its divisors is an integer number (145735101330).
Almost surely, 21124242210143 is an apocalyptic number.
1124242210143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1124242210143 is a deficient number, since it is larger than the sum of its proper divisors (624579005817).
1124242210143 is a wasteful number, since it uses less digits than its factorization.
1124242210143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9608907798 (or 9608907795 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 1124242210143 its reverse (3410122424211), we get a palindrome (4534364634354).
The spelling of 1124242210143 in words is "one trillion, one hundred twenty-four billion, two hundred forty-two million, two hundred ten thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •