Base | Representation |
---|---|
bin | 1001001000111111110010… |
… | …01110100001010011110011 |
3 | 2122011120110210021210221102 |
4 | 10210133321032201103303 |
5 | 10113310440311424334 |
6 | 110425544325115015 |
7 | 4143125666056130 |
oct | 444377116412363 |
9 | 78146423253842 |
10 | 20100333311219 |
11 | 644a55a159857 |
12 | 23076b4b58a6b |
13 | b2a5b7b85445 |
14 | 4d6c0b683587 |
15 | 24ccc84ae67e |
hex | 1247f93a14f3 |
20100333311219 has 8 divisors (see below), whose sum is σ = 23712835611648. Its totient is φ = 16673087539080.
The previous prime is 20100333311213. The next prime is 20100333311231. The reversal of 20100333311219 is 91211333300102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20100333311219 - 28 = 20100333310963 is a prime.
It is a super-2 number, since 2×201003333112192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20100333311191 and 20100333311200.
It is not an unprimeable number, because it can be changed into a prime (20100333311213) 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, 46314131837 + ... + 46314132270.
It is an arithmetic number, because the mean of its divisors is an integer number (2964104451456).
Almost surely, 220100333311219 is an apocalyptic number.
20100333311219 is a deficient number, since it is larger than the sum of its proper divisors (3612502300429).
20100333311219 is an equidigital number, since it uses as much as digits as its factorization.
20100333311219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92628264145.
The product of its (nonzero) digits is 2916, while the sum is 29.
The spelling of 20100333311219 in words is "twenty trillion, one hundred billion, three hundred thirty-three million, three hundred eleven thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •