Base | Representation |
---|---|
bin | 11110101101101011001… |
… | …11011011100100001111 |
3 | 10201212221122110202220000 |
4 | 33112311213123210033 |
5 | 114242240341001033 |
6 | 2124445441255343 |
7 | 136146443665404 |
oct | 17266547334417 |
9 | 3655848422800 |
10 | 1055314000143 |
11 | 3776132719a7 |
12 | 15063a634553 |
13 | 78691c57440 |
14 | 391128142ab |
15 | 1c6b78d9a13 |
hex | f5b59db90f |
1055314000143 has 40 divisors (see below), whose sum is σ = 1704178283808. Its totient is φ = 646954537536.
The previous prime is 1055314000141. The next prime is 1055314000207. The reversal of 1055314000143 is 3410004135501.
It is a happy number.
It is not a de Polignac number, because 1055314000143 - 21 = 1055314000141 is a prime.
It is a super-2 number, since 2×10553140001432 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055314000141) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1628380 + ... + 2182257.
Almost surely, 21055314000143 is an apocalyptic number.
1055314000143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1055314000143 is a deficient number, since it is larger than the sum of its proper divisors (648864283665).
1055314000143 is a wasteful number, since it uses less digits than its factorization.
1055314000143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3810925 (or 3810916 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 1055314000143 its reverse (3410004135501), we get a palindrome (4465318135644).
The spelling of 1055314000143 in words is "one trillion, fifty-five billion, three hundred fourteen million, one hundred forty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •