Base | Representation |
---|---|
bin | 101011111100101101001… |
… | …111010111111101101001 |
3 | 101200201110102111200212100 |
4 | 223330231033113331221 |
5 | 343440201434422441 |
6 | 10231231402404013 |
7 | 431124262024611 |
oct | 53745517277551 |
9 | 11621412450770 |
10 | 3020121014121 |
11 | a6490a63a472 |
12 | 4093a0500609 |
13 | 18ba472c8213 |
14 | a62632bda41 |
15 | 53860e15cb6 |
hex | 2bf2d3d7f69 |
3020121014121 has 12 divisors (see below), whose sum is σ = 4362458529520. Its totient is φ = 2013385620600.
The previous prime is 3020121014047. The next prime is 3020121014147. The reversal of 3020121014121 is 1214101210203.
3020121014121 is a `hidden beast` number, since 30 + 201 + 21 + 0 + 1 + 412 + 1 = 666.
It is not a de Polignac number, because 3020121014121 - 217 = 3020120883049 is a prime.
It is a super-2 number, since 2×30201210141212 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3020121014094 and 3020121014103.
It is not an unprimeable number, because it can be changed into a prime (3020121014171) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1681555 + ... + 2977896.
Almost surely, 23020121014121 is an apocalyptic number.
It is an amenable number.
3020121014121 is a deficient number, since it is larger than the sum of its proper divisors (1342337515399).
3020121014121 is a wasteful number, since it uses less digits than its factorization.
3020121014121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4731476 (or 4731473 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 3020121014121 its reverse (1214101210203), we get a palindrome (4234222224324).
The spelling of 3020121014121 in words is "three trillion, twenty billion, one hundred twenty-one million, fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •