Base | Representation |
---|---|
bin | 10001110000100111100… |
… | …111001111011000100001 |
3 | 11022200011020100102102222 |
4 | 101300213213033120201 |
5 | 124443422414410423 |
6 | 2332354340120425 |
7 | 154113344654435 |
oct | 21604747173041 |
9 | 4280136312388 |
10 | 1220435310113 |
11 | 430646a09038 |
12 | 178641396115 |
13 | 8b118217b96 |
14 | 430d85669c5 |
15 | 21b2dc923c8 |
hex | 11c279cf621 |
1220435310113 has 4 divisors (see below), whose sum is σ = 1220438623620. Its totient is φ = 1220431996608.
The previous prime is 1220435310053. The next prime is 1220435310139. The reversal of 1220435310113 is 3110135340221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 484928391424 + 735506918689 = 696368^2 + 857617^2 .
It is a cyclic number.
It is not a de Polignac number, because 1220435310113 - 28 = 1220435309857 is a prime.
It is a super-2 number, since 2×12204353101132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1220435310313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1023620 + ... + 1867797.
It is an arithmetic number, because the mean of its divisors is an integer number (305109655905).
Almost surely, 21220435310113 is an apocalyptic number.
It is an amenable number.
1220435310113 is a deficient number, since it is larger than the sum of its proper divisors (3313507).
1220435310113 is an equidigital number, since it uses as much as digits as its factorization.
1220435310113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3313506.
The product of its (nonzero) digits is 2160, while the sum is 26.
The spelling of 1220435310113 in words is "one trillion, two hundred twenty billion, four hundred thirty-five million, three hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •