Base | Representation |
---|---|
bin | 11110001111101111100111… |
… | …010001010100010100110101 |
3 | 122102222220102100022002002021 |
4 | 132033233213101110110311 |
5 | 114413423220410413023 |
6 | 1150530022130513141 |
7 | 40006421453332303 |
oct | 3617574721242465 |
9 | 572886370262067 |
10 | 133023312201013 |
11 | 39426962910633 |
12 | 12b049861357b1 |
13 | 592c076a54670 |
14 | 24bc511211273 |
15 | 105a39571b35d |
hex | 78fbe7454535 |
133023312201013 has 16 divisors (see below), whose sum is σ = 148174676971776. Its totient is φ = 118632786802560.
The previous prime is 133023312201011. The next prime is 133023312201103. The reversal of 133023312201013 is 310102213320331.
It is a cyclic number.
It is not a de Polignac number, because 133023312201013 - 21 = 133023312201011 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133023312201011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1211472745 + ... + 1211582542.
It is an arithmetic number, because the mean of its divisors is an integer number (9260917310736).
Almost surely, 2133023312201013 is an apocalyptic number.
133023312201013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
133023312201013 is a deficient number, since it is larger than the sum of its proper divisors (15151364770763).
133023312201013 is a wasteful number, since it uses less digits than its factorization.
133023312201013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2423055444.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 133023312201013 its reverse (310102213320331), we get a palindrome (443125525521344).
The spelling of 133023312201013 in words is "one hundred thirty-three trillion, twenty-three billion, three hundred twelve million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •