Base | Representation |
---|---|
bin | 101011111100101100101… |
… | …101110111111001100001 |
3 | 101200201102210222112002211 |
4 | 223330230231313321201 |
5 | 343440142212411113 |
6 | 10231230450242121 |
7 | 431124124260061 |
oct | 53745455677141 |
9 | 11621383875084 |
10 | 3020112232033 |
11 | a64905691346 |
12 | 409399586341 |
13 | 18ba45541b10 |
14 | a62620753a1 |
15 | 5386027db3d |
hex | 2bf2cb77e61 |
3020112232033 has 16 divisors (see below), whose sum is σ = 3314363055696. Its totient is φ = 2734727224320.
The previous prime is 3020112232031. The next prime is 3020112232079. The reversal of 3020112232033 is 3302322110203.
It can be written as a sum of positive squares in 8 ways, for example, as 62496500049 + 2957615731984 = 249993^2 + 1719772^2 .
It is not a de Polignac number, because 3020112232033 - 21 = 3020112232031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3020112231995 and 3020112232013.
It is not an unprimeable number, because it can be changed into a prime (3020112232031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3679341 + ... + 4424677.
It is an arithmetic number, because the mean of its divisors is an integer number (207147690981).
Almost surely, 23020112232033 is an apocalyptic number.
It is an amenable number.
3020112232033 is a deficient number, since it is larger than the sum of its proper divisors (294250823663).
3020112232033 is a wasteful number, since it uses less digits than its factorization.
3020112232033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 751284.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 3020112232033 its reverse (3302322110203), we get a palindrome (6322434342236).
The spelling of 3020112232033 in words is "three trillion, twenty billion, one hundred twelve million, two hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •