Base | Representation |
---|---|
bin | 101011111100111000000… |
… | …010100110000000001011 |
3 | 101200201221001110120011210 |
4 | 223330320002212000023 |
5 | 343441034331310011 |
6 | 10231301354224203 |
7 | 431131622135610 |
oct | 53747002460013 |
9 | 11621831416153 |
10 | 3020302213131 |
11 | a649a2950a15 |
12 | 409431125063 |
13 | 18ba759cba78 |
14 | a627d3aa507 |
15 | 53871ca96a6 |
hex | 2bf380a600b |
3020302213131 has 16 divisors (see below), whose sum is σ = 4602459450368. Its totient is φ = 1725851664000.
The previous prime is 3020302213069. The next prime is 3020302213151. The reversal of 3020302213131 is 1313122030203.
It is not a de Polignac number, because 3020302213131 - 29 = 3020302212619 is a prime.
It is a super-2 number, since 2×30203022131312 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3020302213098 and 3020302213107.
It is not an unprimeable number, because it can be changed into a prime (3020302213151) 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, 402670 + ... + 2490531.
It is an arithmetic number, because the mean of its divisors is an integer number (287653715648).
Almost surely, 23020302213131 is an apocalyptic number.
3020302213131 is a deficient number, since it is larger than the sum of its proper divisors (1582157237237).
3020302213131 is a wasteful number, since it uses less digits than its factorization.
3020302213131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2942922.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 3020302213131 its reverse (1313122030203), we get a palindrome (4333424243334).
The spelling of 3020302213131 in words is "three trillion, twenty billion, three hundred two million, two hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •