Base | Representation |
---|---|
bin | 1000010101001111011… |
… | …1111101111000110011 |
3 | 111200110202020100102020 |
4 | 2011103313331320303 |
5 | 4321123110213412 |
6 | 145431430322523 |
7 | 13225112166324 |
oct | 2052367757063 |
9 | 450422210366 |
10 | 143141101107 |
11 | 55784468974 |
12 | 238a97b9443 |
13 | 1066257aac4 |
14 | 6cdc88444b |
15 | 3acb88818c |
hex | 2153dfde33 |
143141101107 has 16 divisors (see below), whose sum is σ = 202425858432. Its totient is φ = 89661000320.
The previous prime is 143141101087. The next prime is 143141101109. The reversal of 143141101107 is 701101141341.
It is a cyclic number.
It is not a de Polignac number, because 143141101107 - 231 = 140993617459 is a prime.
It is a super-2 number, since 2×1431411011072 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (143141101109) 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 15 ways as a sum of consecutive naturals, for example, 2360769 + ... + 2420642.
It is an arithmetic number, because the mean of its divisors is an integer number (12651616152).
Almost surely, 2143141101107 is an apocalyptic number.
143141101107 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
143141101107 is a deficient number, since it is larger than the sum of its proper divisors (59284757325).
143141101107 is a wasteful number, since it uses less digits than its factorization.
143141101107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4782018.
The product of its (nonzero) digits is 336, while the sum is 24.
Adding to 143141101107 its reverse (701101141341), we get a palindrome (844242242448).
The spelling of 143141101107 in words is "one hundred forty-three billion, one hundred forty-one million, one hundred one thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •