Base | Representation |
---|---|
bin | 101011111100111000100… |
… | …001100001010001101000 |
3 | 101200201221121201110000210 |
4 | 223330320201201101220 |
5 | 343441043420221412 |
6 | 10231302244101120 |
7 | 431132051062512 |
oct | 53747041412150 |
9 | 11621847643023 |
10 | 3020310320232 |
11 | a649a74889a7 |
12 | 4094339947a0 |
13 | 18ba775a9b7a |
14 | a62804babb2 |
15 | 5387285b83c |
hex | 2bf38861468 |
3020310320232 has 32 divisors (see below), whose sum is σ = 7553540803680. Its totient is φ = 1006401439680.
The previous prime is 3020310320179. The next prime is 3020310320233. The reversal of 3020310320232 is 2320230130203.
It is a junction number, because it is equal to n+sod(n) for n = 3020310320199 and 3020310320208.
It is not an unprimeable number, because it can be changed into a prime (3020310320233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22974783 + ... + 23105870.
It is an arithmetic number, because the mean of its divisors is an integer number (236048150115).
Almost surely, 23020310320232 is an apocalyptic number.
It is an amenable number.
3020310320232 is an abundant number, since it is smaller than the sum of its proper divisors (4533230483448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3020310320232 is a wasteful number, since it uses less digits than its factorization.
3020310320232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46083393 (or 46083389 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 3020310320232 its reverse (2320230130203), we get a palindrome (5340540450435).
The spelling of 3020310320232 in words is "three trillion, twenty billion, three hundred ten million, three hundred twenty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •