Base | Representation |
---|---|
bin | 101011111111011001000… |
… | …010000111100010100100 |
3 | 101200222220021212221020010 |
4 | 223333121002013202210 |
5 | 344012102311021012 |
6 | 10232425402210220 |
7 | 431255560254600 |
oct | 53773102074244 |
9 | 11628807787203 |
10 | 3023003220132 |
11 | a66059565505 |
12 | 409a657b3970 |
13 | 18c0b647896c |
14 | a6457dc2500 |
15 | 5397de8cc3c |
hex | 2bfd90878a4 |
3023003220132 has 72 divisors (see below), whose sum is σ = 8205574847904. Its totient is φ = 863685691008.
The previous prime is 3023003220089. The next prime is 3023003220143. The reversal of 3023003220132 is 2310223003203.
3023003220132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 3023003220099 and 3023003220108.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21743743 + ... + 21882329.
It is an arithmetic number, because the mean of its divisors is an integer number (113966317332).
Almost surely, 23023003220132 is an apocalyptic number.
It is an amenable number.
3023003220132 is an abundant number, since it is smaller than the sum of its proper divisors (5182571627772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3023003220132 is a wasteful number, since it uses less digits than its factorization.
3023003220132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175705 (or 175696 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 3023003220132 its reverse (2310223003203), we get a palindrome (5333226223335).
The spelling of 3023003220132 in words is "three trillion, twenty-three billion, three million, two hundred twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •