Base | Representation |
---|---|
bin | 110110110000110000101001… |
… | …0110011110101110100100100 |
3 | 2100011112011112102211121111021 |
4 | 1231201201102303311310210 |
5 | 1001114004232221040000 |
6 | 4424245331123420524 |
7 | 203313665104533100 |
oct | 15541412263656444 |
9 | 2304464472747437 |
10 | 481690561502500 |
11 | 12a532902359469 |
12 | 46036a36524744 |
13 | 178a12c056516c |
14 | 86d3d3a1cc900 |
15 | 3aa4d2493e11a |
hex | 1b61852cf5d24 |
481690561502500 has 405 divisors, whose sum is σ = 1243801568261637. Its totient is φ = 162699080544000.
The previous prime is 481690561502441. The next prime is 481690561502551. The reversal of 481690561502500 is 5205165096184.
The square root of 481690561502500 is 21947450.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 341656851217444 + 140033710285056 = 18483962^2 + 11833584^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 134 ways as a sum of consecutive naturals, for example, 560757347071 + ... + 560757347929.
Almost surely, 2481690561502500 is an apocalyptic number.
481690561502500 is the 21947450-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 481690561502500
481690561502500 is an abundant number, since it is smaller than the sum of its proper divisors (762111006759137).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
481690561502500 is an frugal number, since it uses more digits than its factorization.
481690561502500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1902 (or 946 counting only the distinct ones).
The product of its (nonzero) digits is 2592000, while the sum is 52.
The spelling of 481690561502500 in words is "four hundred eighty-one trillion, six hundred ninety billion, five hundred sixty-one million, five hundred two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •