Base | Representation |
---|---|
bin | 101011111100101101111… |
… | …001010111101101011011 |
3 | 101200201111012020000101110 |
4 | 223330231321113231123 |
5 | 343440212244220011 |
6 | 10231232434351403 |
7 | 431124454426056 |
oct | 53745571275533 |
9 | 11621435200343 |
10 | 3020132023131 |
11 | a64915879723 |
12 | 4093a412b563 |
13 | 18ba49681122 |
14 | a6264947a9d |
15 | 53861d8cba6 |
hex | 2bf2de57b5b |
3020132023131 has 8 divisors (see below), whose sum is σ = 4050955528704. Its totient is φ = 2001364933160.
The previous prime is 3020132023121. The next prime is 3020132023157. The reversal of 3020132023131 is 1313202310203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3020132023131 - 215 = 3020131990363 is a prime.
It is a super-2 number, since 2×30201320231312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3020132023098 and 3020132023107.
It is not an unprimeable number, because it can be changed into a prime (3020132023121) 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, 3014103315 + ... + 3014104316.
It is an arithmetic number, because the mean of its divisors is an integer number (506369441088).
Almost surely, 23020132023131 is an apocalyptic number.
3020132023131 is a deficient number, since it is larger than the sum of its proper divisors (1030823505573).
3020132023131 is a wasteful number, since it uses less digits than its factorization.
3020132023131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6028207801.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 3020132023131 its reverse (1313202310203), we get a palindrome (4333334333334).
The spelling of 3020132023131 in words is "three trillion, twenty billion, one hundred thirty-two million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •