Base | Representation |
---|---|
bin | 101011111100101110011… |
… | …011101111001011000011 |
3 | 101200201111211011201102010 |
4 | 223330232123233023003 |
5 | 343440222101012011 |
6 | 10231233355424003 |
7 | 431124624130266 |
oct | 53745633571303 |
9 | 11621454151363 |
10 | 3020141032131 |
11 | a6491a972283 |
12 | 4093a7155003 |
13 | 18ba4b4b68b2 |
14 | a6265c10cdd |
15 | 53862a6c1a6 |
hex | 2bf2e6ef2c3 |
3020141032131 has 8 divisors (see below), whose sum is σ = 4027288534720. Its totient is φ = 2013210442152.
The previous prime is 3020141032087. The next prime is 3020141032147. The reversal of 3020141032131 is 1312301410203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3020141032131 - 222 = 3020136837827 is a prime.
It is a super-2 number, since 2×30201410321312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3020141032098 and 3020141032107.
It is not an unprimeable number, because it can be changed into a prime (3020141032231) 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, 54195661 + ... + 54251358.
It is an arithmetic number, because the mean of its divisors is an integer number (503411066840).
Almost surely, 23020141032131 is an apocalyptic number.
3020141032131 is a deficient number, since it is larger than the sum of its proper divisors (1007147502589).
3020141032131 is a wasteful number, since it uses less digits than its factorization.
3020141032131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108456305.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 3020141032131 its reverse (1312301410203), we get a palindrome (4332442442334).
The spelling of 3020141032131 in words is "three trillion, twenty billion, one hundred forty-one million, thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.555 sec. • engine limits •