Base | Representation |
---|---|
bin | 1011111011000110101011… |
… | …1100011111100111101011 |
3 | 1201102022021211200202100011 |
4 | 2332301222330133213223 |
5 | 3204243322303233233 |
6 | 43514400000152351 |
7 | 2522111606002216 |
oct | 276615274374753 |
9 | 51368254622304 |
10 | 13110034430443 |
11 | 41a4a30726a15 |
12 | 15789900086b7 |
13 | 74136a34ba62 |
14 | 334759a0c77d |
15 | 17b04e7d10cd |
hex | bec6af1f9eb |
13110034430443 has 8 divisors (see below), whose sum is σ = 13276074502080. Its totient is φ = 12943996615680.
The previous prime is 13110034430429. The next prime is 13110034430459. The reversal of 13110034430443 is 34403443001131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13110034430443 - 221 = 13110032333291 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13110034430743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13257771 + ... + 14212267.
It is an arithmetic number, because the mean of its divisors is an integer number (1659509312760).
Almost surely, 213110034430443 is an apocalyptic number.
13110034430443 is a deficient number, since it is larger than the sum of its proper divisors (166040071637).
13110034430443 is an equidigital number, since it uses as much as digits as its factorization.
13110034430443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1128437.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 13110034430443 its reverse (34403443001131), we get a palindrome (47513477431574).
The spelling of 13110034430443 in words is "thirteen trillion, one hundred ten billion, thirty-four million, four hundred thirty thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •