Base | Representation |
---|---|
bin | 10100100110100111001100… |
… | …00010111100111110000000 |
3 | 12221102022201220012011220010 |
4 | 22103103212002330332000 |
5 | 21414303043142300104 |
6 | 240205454553544520 |
7 | 12354223010430510 |
oct | 1223234602747600 |
9 | 187368656164803 |
10 | 45307174571904 |
11 | 134887349879a3 |
12 | 50b8a01115140 |
13 | 1c385a99b683b |
14 | b28c43ba3840 |
15 | 5388248eb489 |
hex | 2934e60bcf80 |
45307174571904 has 512 divisors, whose sum is σ = 143273987112960. Its totient is φ = 12413302824960.
The previous prime is 45307174571891. The next prime is 45307174571909. The reversal of 45307174571904 is 40917547170354.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45307174571909) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4713110202 + ... + 4713119814.
It is an arithmetic number, because the mean of its divisors is an integer number (279832006080).
Almost surely, 245307174571904 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 45307174571904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71636993556480).
45307174571904 is an abundant number, since it is smaller than the sum of its proper divisors (97966812541056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45307174571904 is a wasteful number, since it uses less digits than its factorization.
45307174571904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10178 (or 10166 counting only the distinct ones).
The product of its (nonzero) digits is 14817600, while the sum is 57.
The spelling of 45307174571904 in words is "forty-five trillion, three hundred seven billion, one hundred seventy-four million, five hundred seventy-one thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •