Base | Representation |
---|---|
bin | 110011100111001010000101… |
… | …1111101001011100011000100 |
3 | 2012112102022021200200021012221 |
4 | 1213032110023331023203010 |
5 | 434001022214404220311 |
6 | 4245312411003022124 |
7 | 164424104344210000 |
oct | 14716241375134304 |
9 | 2175368250607187 |
10 | 453982538741956 |
11 | 12171aa05901784 |
12 | 42b00a3580a944 |
13 | 166414a6336cb3 |
14 | 8016c2d123700 |
15 | 37741dad0c671 |
hex | 19ce50bf4b8c4 |
453982538741956 has 135 divisors (see below), whose sum is σ = 978259051346031. Its totient is φ = 184307629543632.
The previous prime is 453982538741917. The next prime is 453982538741971. The reversal of 453982538741956 is 659147835289354.
The square root of 453982538741956 is 21306866.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×4539825387419562 (a number of 30 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 39673378771 + ... + 39673390213.
Almost surely, 2453982538741956 is an apocalyptic number.
453982538741956 is the 21306866-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 453982538741956
453982538741956 is an abundant number, since it is smaller than the sum of its proper divisors (524276512604075).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
453982538741956 is an frugal number, since it uses more digits than its factorization.
453982538741956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22956 (or 11471 counting only the distinct ones).
The product of its digits is 7838208000, while the sum is 79.
The spelling of 453982538741956 in words is "four hundred fifty-three trillion, nine hundred eighty-two billion, five hundred thirty-eight million, seven hundred forty-one thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •