Base | Representation |
---|---|
bin | 10111011111100000011101… |
… | …000001001011011110110011 |
3 | 111112211022112210020101222201 |
4 | 113133200131001023132303 |
5 | 102020244302322333021 |
6 | 1003424353122444031 |
7 | 30522432241415065 |
oct | 2737403501133663 |
9 | 445738483211881 |
10 | 103320220121011 |
11 | 2aa1494a784363 |
12 | b708198803617 |
13 | 458609395cb9a |
14 | 1b72a22471735 |
15 | be28e191e591 |
hex | 5df81d04b7b3 |
103320220121011 has 4 divisors (see below), whose sum is σ = 103321485807952. Its totient is φ = 103318954434072.
The previous prime is 103320220120991. The next prime is 103320220121017. The reversal of 103320220121011 is 110121022023301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103320220121011 - 211 = 103320220118963 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103320220121011.
It is not an unprimeable number, because it can be changed into a prime (103320220121017) 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, 632721015 + ... + 632884288.
It is an arithmetic number, because the mean of its divisors is an integer number (25830371451988).
Almost surely, 2103320220121011 is an apocalyptic number.
103320220121011 is a deficient number, since it is larger than the sum of its proper divisors (1265686941).
103320220121011 is an equidigital number, since it uses as much as digits as its factorization.
103320220121011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1265686940.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 103320220121011 its reverse (110121022023301), we get a palindrome (213441242144312).
The spelling of 103320220121011 in words is "one hundred three trillion, three hundred twenty billion, two hundred twenty million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •