Base | Representation |
---|---|
bin | 10011101010010100110… |
… | …010111010011100111101 |
3 | 11210011110121022122210222 |
4 | 103222110302322130331 |
5 | 134114041210334113 |
6 | 2512405535111125 |
7 | 166420626256205 |
oct | 23522462723475 |
9 | 4704417278728 |
10 | 1351116105533 |
11 | 4810068aa907 |
12 | 199a320724a5 |
13 | 9a54316672c |
14 | 4957420b405 |
15 | 2522b782e08 |
hex | 13a94cba73d |
1351116105533 has 8 divisors (see below), whose sum is σ = 1374181764000. Its totient is φ = 1328080002480.
The previous prime is 1351116105529. The next prime is 1351116105551. The reversal of 1351116105533 is 3355016111531.
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 1351116105533 - 22 = 1351116105529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1351116105493 and 1351116105502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1351116105503) 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, 7296635 + ... + 7479512.
It is an arithmetic number, because the mean of its divisors is an integer number (171772720500).
Almost surely, 21351116105533 is an apocalyptic number.
It is an amenable number.
1351116105533 is a deficient number, since it is larger than the sum of its proper divisors (23065658467).
1351116105533 is a wasteful number, since it uses less digits than its factorization.
1351116105533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14777707.
The product of its (nonzero) digits is 20250, while the sum is 35.
The spelling of 1351116105533 in words is "one trillion, three hundred fifty-one billion, one hundred sixteen million, one hundred five thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •