Base | Representation |
---|---|
bin | 10001110000011111101… |
… | …011000110001100100011 |
3 | 11022122210221200211002110 |
4 | 101300133223012030203 |
5 | 124443134314301311 |
6 | 2332333221050403 |
7 | 154110136506453 |
oct | 21603753061443 |
9 | 4278727624073 |
10 | 1220302103331 |
11 | 4305887a6893 |
12 | 178604856a03 |
13 | 8b0c67488bc |
14 | 430c49add63 |
15 | 21b2222d8a6 |
hex | 11c1fac6323 |
1220302103331 has 8 divisors (see below), whose sum is σ = 1627102471360. Its totient is φ = 813518235432.
The previous prime is 1220302103327. The next prime is 1220302103353. The reversal of 1220302103331 is 1333012030221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1220302103331 - 22 = 1220302103327 is a prime.
It is a super-2 number, since 2×12203021033312 (a number of 25 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 = 1220302103298 and 1220302103307.
It is not an unprimeable number, because it can be changed into a prime (1220302103381) 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, 3951421 + ... + 4249038.
It is an arithmetic number, because the mean of its divisors is an integer number (203387808920).
Almost surely, 21220302103331 is an apocalyptic number.
1220302103331 is a deficient number, since it is larger than the sum of its proper divisors (406800368029).
1220302103331 is an equidigital number, since it uses as much as digits as its factorization.
1220302103331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8250065.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1220302103331 its reverse (1333012030221), we get a palindrome (2553314133552).
The spelling of 1220302103331 in words is "one trillion, two hundred twenty billion, three hundred two million, one hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •