Base | Representation |
---|---|
bin | 101100011010101100100… |
… | …100100101100000100100 |
3 | 101210210120120102220202210 |
4 | 230122230210211200210 |
5 | 400002123421132012 |
6 | 10254114542403420 |
7 | 433344246235113 |
oct | 54325444454044 |
9 | 11723516386683 |
10 | 3052322052132 |
11 | a77534251981 |
12 | 413688590570 |
13 | 191aa9696272 |
14 | a7a39b95c7a |
15 | 545e7db423c |
hex | 2c6ac925824 |
3052322052132 has 24 divisors (see below), whose sum is σ = 7132244700672. Its totient is φ = 1015989268000.
The previous prime is 3052322052113. The next prime is 3052322052139. The reversal of 3052322052132 is 2312502232503.
It is a self number, because there is not a number n which added to its sum of digits gives 3052322052132.
It is not an unprimeable number, because it can be changed into a prime (3052322052139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 181418244 + ... + 181435067.
It is an arithmetic number, because the mean of its divisors is an integer number (297176862528).
Almost surely, 23052322052132 is an apocalyptic number.
It is an amenable number.
3052322052132 is an abundant number, since it is smaller than the sum of its proper divisors (4079922648540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3052322052132 is a wasteful number, since it uses less digits than its factorization.
3052322052132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 362854019 (or 362854017 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 30.
Adding to 3052322052132 its reverse (2312502232503), we get a palindrome (5364824284635).
The spelling of 3052322052132 in words is "three trillion, fifty-two billion, three hundred twenty-two million, fifty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •