Base | Representation |
---|---|
bin | 101100110001010101010… |
… | …101011001100100000000 |
3 | 101220010022111212001121121 |
4 | 230301111111121210000 |
5 | 400401413313211044 |
6 | 10313214501002024 |
7 | 435164500460200 |
oct | 54612525314400 |
9 | 11803274761547 |
10 | 3076628257024 |
11 | a86877497413 |
12 | 4183306b3314 |
13 | 19418125371a |
14 | a8ca3d3c400 |
15 | 5506bbdc984 |
hex | 2cc55559900 |
3076628257024 has 81 divisors (see below), whose sum is σ = 7144345795041. Its totient is φ = 1318470773760.
The previous prime is 3076628256997. The next prime is 3076628257049. The reversal of 3076628257024 is 4207528266703.
The square root of 3076628257024 is 1754032.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 3048404257024 + 28224000000 = 1745968^2 + 168000^2 .
It is an unprimeable number.
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 8 ways as a sum of consecutive naturals, for example, 196443754 + ... + 196459414.
Almost surely, 23076628257024 is an apocalyptic number.
3076628257024 is the 1754032-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3076628257024
3076628257024 is an abundant number, since it is smaller than the sum of its proper divisors (4067717538017).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3076628257024 is an frugal number, since it uses more digits than its factorization.
3076628257024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31352 (or 15670 counting only the distinct ones).
The product of its (nonzero) digits is 6773760, while the sum is 52.
The spelling of 3076628257024 in words is "three trillion, seventy-six billion, six hundred twenty-eight million, two hundred fifty-seven thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •