Base | Representation |
---|---|
bin | 1101001101011101100… |
… | …10100101011000000000 |
3 | 1121101121100120102210210 |
4 | 12212232302211120000 |
5 | 24414043414440302 |
6 | 544304243154120 |
7 | 44536110603405 |
oct | 6465662453000 |
9 | 1541540512723 |
10 | 453904061952 |
11 | 165555011a30 |
12 | 73b77675940 |
13 | 33a5917baa3 |
14 | 17d7d1d22ac |
15 | bc18db266c |
hex | 69aeca5600 |
453904061952 has 320 divisors, whose sum is σ = 1350669551616. Its totient is φ = 134287196160.
The previous prime is 453904061927. The next prime is 453904061977. The reversal of 453904061952 is 259160409354.
It is an interprime number because it is at equal distance from previous prime (453904061927) and next prime (453904061977).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 199692688 + ... + 199694960.
Almost surely, 2453904061952 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 453904061952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (675334775808).
453904061952 is an abundant number, since it is smaller than the sum of its proper divisors (896765489664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
453904061952 is a wasteful number, since it uses less digits than its factorization.
453904061952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2581 (or 2565 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 48.
The spelling of 453904061952 in words is "four hundred fifty-three billion, nine hundred four million, sixty-one thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •