Base | Representation |
---|---|
bin | 11110001111011011111101… |
… | …100110110111101001110011 |
3 | 122102220212221211202112210110 |
4 | 132033123331212313221303 |
5 | 114413102012300104021 |
6 | 1150512212302432403 |
7 | 40005043542464613 |
oct | 3617337546675163 |
9 | 572825854675713 |
10 | 133002212113011 |
11 | 39418a1541717a |
12 | 12b00877892703 |
13 | 592a093497ca7 |
14 | 24bb4acba6a43 |
15 | 1059a5d0ed476 |
hex | 78f6fd9b7a73 |
133002212113011 has 8 divisors (see below), whose sum is σ = 179833976941824. Its totient is φ = 87419294346440.
The previous prime is 133002212113009. The next prime is 133002212113031. The reversal of 133002212113011 is 110311212200331.
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 133002212113011 - 21 = 133002212113009 is a prime.
It is a super-2 number, since 2×1330022121130112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (133002212113031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 312211765311 + ... + 312211765736.
It is an arithmetic number, because the mean of its divisors is an integer number (22479247117728).
Almost surely, 2133002212113011 is an apocalyptic number.
133002212113011 is a deficient number, since it is larger than the sum of its proper divisors (46831764828813).
133002212113011 is an equidigital number, since it uses as much as digits as its factorization.
133002212113011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 624423531121.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 133002212113011 its reverse (110311212200331), we get a palindrome (243313424313342).
The spelling of 133002212113011 in words is "one hundred thirty-three trillion, two billion, two hundred twelve million, one hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •