Base | Representation |
---|---|
bin | 1011111100100001001101… |
… | …0101101000110011001011 |
3 | 1201111122000100102122121222 |
4 | 2333020103111220303023 |
5 | 3210143104103233121 |
6 | 43533455133352255 |
7 | 2523632023412165 |
oct | 277102325506313 |
9 | 51448010378558 |
10 | 13134334430411 |
11 | 4204270413617 |
12 | 158163203868b |
13 | 743740845b6c |
14 | 3359c301b935 |
15 | 17b9c2cd10ab |
hex | bf213568ccb |
13134334430411 has 8 divisors (see below), whose sum is σ = 13179922680960. Its totient is φ = 13088816479872.
The previous prime is 13134334430401. The next prime is 13134334430551. The reversal of 13134334430411 is 11403443343131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13134334430411 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13134334430401) 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 7 ways as a sum of consecutive naturals, for example, 17200676 + ... + 17948033.
It is an arithmetic number, because the mean of its divisors is an integer number (1647490335120).
Almost surely, 213134334430411 is an apocalyptic number.
13134334430411 is a deficient number, since it is larger than the sum of its proper divisors (45588250549).
13134334430411 is an equidigital number, since it uses as much as digits as its factorization.
13134334430411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35150005.
The product of its (nonzero) digits is 62208, while the sum is 35.
Adding to 13134334430411 its reverse (11403443343131), we get a palindrome (24537777773542).
The spelling of 13134334430411 in words is "thirteen trillion, one hundred thirty-four billion, three hundred thirty-four million, four hundred thirty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •