Base | Representation |
---|---|
bin | 101100100101010100010… |
… | …001001010010000000000 |
3 | 101211220000021222101122200 |
4 | 230211110101022100000 |
5 | 400144002204412444 |
6 | 10303242301233200 |
7 | 434226654533364 |
oct | 54452421122000 |
9 | 11756007871580 |
10 | 3063725466624 |
11 | a81356177a79 |
12 | 41592b562800 |
13 | 192ba60593c4 |
14 | a83dc4792a4 |
15 | 54a6408d969 |
hex | 2c95444a400 |
3063725466624 has 132 divisors (see below), whose sum is σ = 8848294706316. Its totient is φ = 1021027811328.
The previous prime is 3063725466619. The next prime is 3063725466647. The reversal of 3063725466624 is 4266645273603.
It can be written as a sum of positive squares in 2 ways, for example, as 1265895014400 + 1797830452224 = 1125120^2 + 1340832^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 47457792 + ... + 47522304.
Almost surely, 23063725466624 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3063725466624, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4424147353158).
3063725466624 is an abundant number, since it is smaller than the sum of its proper divisors (5784569239692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3063725466624 is a wasteful number, since it uses less digits than its factorization.
3063725466624 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69692 (or 69671 counting only the distinct ones).
The product of its (nonzero) digits is 26127360, while the sum is 54.
The spelling of 3063725466624 in words is "three trillion, sixty-three billion, seven hundred twenty-five million, four hundred sixty-six thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.268 sec. • engine limits •