Base | Representation |
---|---|
bin | 101110110110111000001… |
… | …101011001000110011011 |
3 | 102101211102210122022111202 |
4 | 232312320031121012123 |
5 | 410224100340220011 |
6 | 10503131321344415 |
7 | 451432060044653 |
oct | 56667015310633 |
9 | 12354383568452 |
10 | 3220021023131 |
11 | 103166aa15990 |
12 | 44008a63810b |
13 | 1a48539a7a13 |
14 | b1bc7db3363 |
15 | 58b606d823b |
hex | 2edb835919b |
3220021023131 has 8 divisors (see below), whose sum is σ = 3517582059264. Its totient is φ = 2923265295720.
The previous prime is 3220021023119. The next prime is 3220021023139. The reversal of 3220021023131 is 1313201200223.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3220021023131 - 26 = 3220021023067 is a prime.
It is a super-2 number, since 2×32200210231312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3220021023139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 201318815 + ... + 201334808.
It is an arithmetic number, because the mean of its divisors is an integer number (439697757408).
Almost surely, 23220021023131 is an apocalyptic number.
3220021023131 is a deficient number, since it is larger than the sum of its proper divisors (297561036133).
3220021023131 is a wasteful number, since it uses less digits than its factorization.
3220021023131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402654361.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 3220021023131 its reverse (1313201200223), we get a palindrome (4533222223354).
The spelling of 3220021023131 in words is "three trillion, two hundred twenty billion, twenty-one million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •