Base | Representation |
---|---|
bin | 101110110110111110011… |
… | …000010010110011111100 |
3 | 102101211201000102201210100 |
4 | 232312332120102303330 |
5 | 410224303340404002 |
6 | 10503145500241100 |
7 | 451434455003550 |
oct | 56667630226374 |
9 | 12354630381710 |
10 | 3220124544252 |
11 | 10317133a1930 |
12 | 4400b9240190 |
13 | 1a486c282115 |
14 | b1bd7a3d860 |
15 | 58b6983611c |
hex | 2edbe612cfc |
3220124544252 has 144 divisors (see below), whose sum is σ = 10498211942400. Its totient is φ = 807554724480.
The previous prime is 3220124544181. The next prime is 3220124544257. The reversal of 3220124544252 is 2524454210223.
3220124544252 is a `hidden beast` number, since 3 + 2 + 201 + 2 + 4 + 5 + 442 + 5 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3220124544257) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 19948252 + ... + 20109027.
It is an arithmetic number, because the mean of its divisors is an integer number (72904249600).
Almost surely, 23220124544252 is an apocalyptic number.
It is an amenable number.
3220124544252 is an abundant number, since it is smaller than the sum of its proper divisors (7278087398148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3220124544252 is a wasteful number, since it uses less digits than its factorization.
3220124544252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40057336 (or 40057331 counting only the distinct ones).
The product of its (nonzero) digits is 153600, while the sum is 36.
Adding to 3220124544252 its reverse (2524454210223), we get a palindrome (5744578754475).
The spelling of 3220124544252 in words is "three trillion, two hundred twenty billion, one hundred twenty-four million, five hundred forty-four thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •