Base | Representation |
---|---|
bin | 10000010110010001110… |
… | …100110111101011101111 |
3 | 10222101202222102112021200 |
4 | 100112101310313223233 |
5 | 121401242323121033 |
6 | 2220033100300543 |
7 | 144110501053350 |
oct | 20262164675357 |
9 | 3871688375250 |
10 | 1123433020143 |
11 | 3a3499719945 |
12 | 16188b541753 |
13 | 81c2979a575 |
14 | 3c5356b3d27 |
15 | 1e352ce8013 |
hex | 10591d37aef |
1123433020143 has 24 divisors (see below), whose sum is σ = 1864265834496. Its totient is φ = 638600662800.
The previous prime is 1123433020141. The next prime is 1123433020159. The reversal of 1123433020143 is 3410203343211.
It is a happy number.
1123433020143 is a `hidden beast` number, since 1 + 1 + 2 + 343 + 302 + 0 + 14 + 3 = 666.
It is not a de Polignac number, because 1123433020143 - 21 = 1123433020141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123433020141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 46669303 + ... + 46693368.
It is an arithmetic number, because the mean of its divisors is an integer number (77677743104).
Almost surely, 21123433020143 is an apocalyptic number.
1123433020143 is a deficient number, since it is larger than the sum of its proper divisors (740832814353).
1123433020143 is a wasteful number, since it uses less digits than its factorization.
1123433020143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93362875 (or 93362872 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 1123433020143 its reverse (3410203343211), we get a palindrome (4533636363354).
The spelling of 1123433020143 in words is "one trillion, one hundred twenty-three billion, four hundred thirty-three million, twenty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •