Base | Representation |
---|---|
bin | 11110010010111100100110… |
… | …001001011011100100000101 |
3 | 122110202221112100221120221221 |
4 | 132102330212021123210011 |
5 | 114431030001032231323 |
6 | 1151215102215440341 |
7 | 40031342631401566 |
oct | 3622744611334405 |
9 | 573687470846857 |
10 | 133243410430213 |
11 | 395012385a2906 |
12 | 12b3b5706860b1 |
13 | 5946a51bc1c45 |
14 | 24c903066816d |
15 | 1060e7836155d |
hex | 792f2625b905 |
133243410430213 has 16 divisors (see below), whose sum is σ = 133886084677632. Its totient is φ = 132602590782000.
The previous prime is 133243410430133. The next prime is 133243410430231. The reversal of 133243410430213 is 312034014342331.
It is a cyclic number.
It is not a de Polignac number, because 133243410430213 - 213 = 133243410422021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133243410430283) 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 15 ways as a sum of consecutive naturals, for example, 320033968 + ... + 320450038.
It is an arithmetic number, because the mean of its divisors is an integer number (8367880292352).
Almost surely, 2133243410430213 is an apocalyptic number.
It is an amenable number.
133243410430213 is a deficient number, since it is larger than the sum of its proper divisors (642674247419).
133243410430213 is a wasteful number, since it uses less digits than its factorization.
133243410430213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418296.
The product of its (nonzero) digits is 62208, while the sum is 34.
Adding to 133243410430213 its reverse (312034014342331), we get a palindrome (445277424772544).
The spelling of 133243410430213 in words is "one hundred thirty-three trillion, two hundred forty-three billion, four hundred ten million, four hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •