Base | Representation |
---|---|
bin | 10001110000001110010… |
… | …010000000010110101101 |
3 | 11022122001121122100012002 |
4 | 101300032102000112231 |
5 | 124442040120010013 |
6 | 2332244235022045 |
7 | 154066664362253 |
oct | 21601622002655 |
9 | 4278047570162 |
10 | 1220010313133 |
11 | 43044901a567 |
12 | 178542b9a925 |
13 | 8b07b163891 |
14 | 43097d365d3 |
15 | 21b067e2358 |
hex | 11c0e4805ad |
1220010313133 has 4 divisors (see below), whose sum is σ = 1220628668028. Its totient is φ = 1219391958240.
The previous prime is 1220010313099. The next prime is 1220010313169. The reversal of 1220010313133 is 3313130100221.
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 628806178729 + 591204134404 = 792973^2 + 768898^2 .
It is a cyclic number.
It is not a de Polignac number, because 1220010313133 - 26 = 1220010313069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220010313933) 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, 309174488 + ... + 309178433.
It is an arithmetic number, because the mean of its divisors is an integer number (305157167007).
Almost surely, 21220010313133 is an apocalyptic number.
It is an amenable number.
1220010313133 is a deficient number, since it is larger than the sum of its proper divisors (618354895).
1220010313133 is an equidigital number, since it uses as much as digits as its factorization.
1220010313133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 618354894.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1220010313133 its reverse (3313130100221), we get a palindrome (4533140413354).
The spelling of 1220010313133 in words is "one trillion, two hundred twenty billion, ten million, three hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •