Base | Representation |
---|---|
bin | 1001001001111101001100… |
… | …10000010010010001000101 |
3 | 2122021201120100211002120021 |
4 | 10210332212100102101011 |
5 | 10114331000024101313 |
6 | 110453035533135141 |
7 | 4145403652610440 |
oct | 444764620222105 |
9 | 78251510732507 |
10 | 20133301003333 |
11 | 64625375a68a1 |
12 | 2311b7592a4b1 |
13 | b3074002c47b |
14 | 4d8657cc4657 |
15 | 24daa78e978d |
hex | 124fa6412445 |
20133301003333 has 8 divisors (see below), whose sum is σ = 23399478164160. Its totient is φ = 16964621668320.
The previous prime is 20133301003273. The next prime is 20133301003369. The reversal of 20133301003333 is 33330010333102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-20133301003333 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20133301003298 and 20133301003307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20133301003633) 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, 24374456008 + ... + 24374456833.
It is an arithmetic number, because the mean of its divisors is an integer number (2924934770520).
Almost surely, 220133301003333 is an apocalyptic number.
It is an amenable number.
20133301003333 is a deficient number, since it is larger than the sum of its proper divisors (3266177160827).
20133301003333 is an equidigital number, since it uses as much as digits as its factorization.
20133301003333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48748912907.
The product of its (nonzero) digits is 4374, while the sum is 25.
Adding to 20133301003333 its reverse (33330010333102), we get a palindrome (53463311336435).
The spelling of 20133301003333 in words is "twenty trillion, one hundred thirty-three billion, three hundred one million, three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •