Base | Representation |
---|---|
bin | 1000010100111101001… |
… | …0000101000011010001 |
3 | 111200021101021021001002 |
4 | 2011033102011003101 |
5 | 4320443344410423 |
6 | 145420035151345 |
7 | 13223155306112 |
oct | 2051722050321 |
9 | 450241237032 |
10 | 143064060113 |
11 | 55744a28927 |
12 | 23887a45555 |
13 | 1064c615510 |
14 | 6cd254c209 |
15 | 3ac4c1b228 |
hex | 214f4850d1 |
143064060113 has 4 divisors (see below), whose sum is σ = 154068987828. Its totient is φ = 132059132400.
The previous prime is 143064060109. The next prime is 143064060127. The reversal of 143064060113 is 311060460341.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 311060460341 = 3319 ⋅93721139.
It can be written as a sum of positive squares in 2 ways, for example, as 39578317249 + 103485742864 = 198943^2 + 321692^2 .
It is not a de Polignac number, because 143064060113 - 22 = 143064060109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (143064060193) 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, 5502463838 + ... + 5502463863.
It is an arithmetic number, because the mean of its divisors is an integer number (38517246957).
Almost surely, 2143064060113 is an apocalyptic number.
143064060113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
143064060113 is a deficient number, since it is larger than the sum of its proper divisors (11004927715).
143064060113 is a wasteful number, since it uses less digits than its factorization.
143064060113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11004927714.
The product of its (nonzero) digits is 5184, while the sum is 29.
The spelling of 143064060113 in words is "one hundred forty-three billion, sixty-four million, sixty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •