Base | Representation |
---|---|
bin | 101011111100100111110… |
… | …101011010011010010001 |
3 | 101200201020002212002002210 |
4 | 223330213311122122101 |
5 | 343440010230303241 |
6 | 10231214402502333 |
7 | 431122111121205 |
oct | 53744765323221 |
9 | 11621202762083 |
10 | 3020030322321 |
11 | a64873426371 |
12 | 4093760649a9 |
13 | 18ba3159342c |
14 | a6255232b05 |
15 | 53857e9e316 |
hex | 2bf27d5a691 |
3020030322321 has 4 divisors (see below), whose sum is σ = 4026707096432. Its totient is φ = 2013353548212.
The previous prime is 3020030322293. The next prime is 3020030322329. The reversal of 3020030322321 is 1232230300203.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 3020030322321 - 215 = 3020030289553 is a prime.
It is a super-3 number, since 3×30200303223213 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3020030322329) 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, 503338387051 + ... + 503338387056.
It is an arithmetic number, because the mean of its divisors is an integer number (1006676774108).
Almost surely, 23020030322321 is an apocalyptic number.
It is an amenable number.
3020030322321 is a deficient number, since it is larger than the sum of its proper divisors (1006676774111).
3020030322321 is a wasteful number, since it uses less digits than its factorization.
3020030322321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1006676774110.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 3020030322321 its reverse (1232230300203), we get a palindrome (4252260622524).
The spelling of 3020030322321 in words is "three trillion, twenty billion, thirty million, three hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •