Base | Representation |
---|---|
bin | 100100001010001000000… |
… | …0100000000000000000000 |
3 | 122121002021020202102120211 |
4 | 1020110100010000000000 |
5 | 1122410112420124004 |
6 | 14322551143243504 |
7 | 1022015666343100 |
oct | 110242004000000 |
9 | 18532236672524 |
10 | 4969546645504 |
11 | 16466335865a1 |
12 | 68316b149594 |
13 | 2a081aac968c |
14 | 132755049200 |
15 | 89408de5504 |
hex | 48510100000 |
4969546645504 has 189 divisors, whose sum is σ = 11599092620031. Its totient is φ = 2122957455360.
The previous prime is 4969546645501. The next prime is 4969546645513. The reversal of 4969546645504 is 4055466459694.
It is a happy number.
The square root of 4969546645504 is 2229248.
It is a perfect power (a square), and thus also a powerful number.
It is a self number, because there is not a number n which added to its sum of digits gives 4969546645504.
It is not an unprimeable number, because it can be changed into a prime (4969546645501) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 15979249509 + ... + 15979249819.
Almost surely, 24969546645504 is an apocalyptic number.
4969546645504 is the 2229248-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4969546645504
4969546645504 is an abundant number, since it is smaller than the sum of its proper divisors (6629545974527).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4969546645504 is an frugal number, since it uses more digits than its factorization.
4969546645504 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 676 (or 320 counting only the distinct ones).
The product of its (nonzero) digits is 559872000, while the sum is 67.
The spelling of 4969546645504 in words is "four trillion, nine hundred sixty-nine billion, five hundred forty-six million, six hundred forty-five thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •