Base | Representation |
---|---|
bin | 1000010100111000010… |
… | …1111111101010100001 |
3 | 111200012222201221122002 |
4 | 2011032011333222201 |
5 | 4320423243140410 |
6 | 145414043453345 |
7 | 13222523626313 |
oct | 2051605775241 |
9 | 450188657562 |
10 | 143044115105 |
11 | 55734745951 |
12 | 23881227255 |
13 | 10648451138 |
14 | 6ccda397b3 |
15 | 3ac30cb7a5 |
hex | 214e17faa1 |
143044115105 has 32 divisors (see below), whose sum is σ = 178074464256. Its totient is φ = 110220735744.
The previous prime is 143044115069. The next prime is 143044115111. The reversal of 143044115105 is 501511440341.
143044115105 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 143044115105 - 218 = 143043852961 is a prime.
It is a super-2 number, since 2×1430441151052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10965647 + ... + 10978683.
It is an arithmetic number, because the mean of its divisors is an integer number (5564827008).
Almost surely, 2143044115105 is an apocalyptic number.
It is an amenable number.
143044115105 is a deficient number, since it is larger than the sum of its proper divisors (35030349151).
143044115105 is a wasteful number, since it uses less digits than its factorization.
143044115105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13673.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 143044115105 its reverse (501511440341), we get a palindrome (644555555446).
The spelling of 143044115105 in words is "one hundred forty-three billion, forty-four million, one hundred fifteen thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •