Base | Representation |
---|---|
bin | 10000011100100001110… |
… | …010010101011110011111 |
3 | 11000001002121220010101102 |
4 | 100130201302111132133 |
5 | 122004013132222033 |
6 | 2223103003503315 |
7 | 144436001025656 |
oct | 20344162253637 |
9 | 4001077803342 |
10 | 1130143242143 |
11 | 3a6322440a63 |
12 | 163042827b3b |
13 | 82758a44326 |
14 | 3c9b095c19d |
15 | 1e5e6e71de8 |
hex | 10721c9579f |
1130143242143 has 4 divisors (see below), whose sum is σ = 1130254585488. Its totient is φ = 1130031898800.
The previous prime is 1130143242133. The next prime is 1130143242167. The reversal of 1130143242143 is 3412423410311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1130143242143 - 216 = 1130143176607 is a prime.
It is a super-3 number, since 3×11301432421433 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130143242133) 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, 55656446 + ... + 55676747.
It is an arithmetic number, because the mean of its divisors is an integer number (282563646372).
Almost surely, 21130143242143 is an apocalyptic number.
1130143242143 is a deficient number, since it is larger than the sum of its proper divisors (111343345).
1130143242143 is a wasteful number, since it uses less digits than its factorization.
1130143242143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111343344.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 1130143242143 its reverse (3412423410311), we get a palindrome (4542566652454).
The spelling of 1130143242143 in words is "one trillion, one hundred thirty billion, one hundred forty-three million, two hundred forty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •