Base | Representation |
---|---|
bin | 101011111100101101010… |
… | …011111001110000001111 |
3 | 101200201110111202000002122 |
4 | 223330231103321300033 |
5 | 343440202240413403 |
6 | 10231231444043155 |
7 | 431124305100320 |
oct | 53745523716017 |
9 | 11621414660078 |
10 | 3020122201103 |
11 | a64910280247 |
12 | 4093a09934bb |
13 | 18ba47622587 |
14 | a626350c447 |
15 | 5386109c838 |
hex | 2bf2d4f9c0f |
3020122201103 has 8 divisors (see below), whose sum is σ = 3451690803840. Its totient is φ = 2588584241880.
The previous prime is 3020122201099. The next prime is 3020122201199. The reversal of 3020122201103 is 3011022210203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3020122201103 - 22 = 3020122201099 is a prime.
It is a super-3 number, since 3×30201222011033 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3020122201003) 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, 7449293 + ... + 7844246.
It is an arithmetic number, because the mean of its divisors is an integer number (431461350480).
Almost surely, 23020122201103 is an apocalyptic number.
3020122201103 is a deficient number, since it is larger than the sum of its proper divisors (431568602737).
3020122201103 is a wasteful number, since it uses less digits than its factorization.
3020122201103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15321757.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 3020122201103 its reverse (3011022210203), we get a palindrome (6031144411306).
The spelling of 3020122201103 in words is "three trillion, twenty billion, one hundred twenty-two million, two hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •