Base | Representation |
---|---|
bin | 1101001100100011011… |
… | …01110000001110011100 |
3 | 1121100100100200100101221 |
4 | 12212101231300032130 |
5 | 24412044030201122 |
6 | 544144015543124 |
7 | 44521035406000 |
oct | 6462155601634 |
9 | 1540310610357 |
10 | 453416256412 |
11 | 165324724459 |
12 | 73a6022aaa4 |
13 | 339ac0a6362 |
14 | 17d344d2700 |
15 | bbdb1576c7 |
hex | 6991b7039c |
453416256412 has 96 divisors (see below), whose sum is σ = 965045043200. Its totient is φ = 186112442880.
The previous prime is 453416256409. The next prime is 453416256413. The reversal of 453416256412 is 214652614354.
It is a super-2 number, since 2×4534162564122 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (453416256413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4070653 + ... + 4180555.
Almost surely, 2453416256412 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 453416256412, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (482522521600).
453416256412 is an abundant number, since it is smaller than the sum of its proper divisors (511628786788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
453416256412 is a wasteful number, since it uses less digits than its factorization.
453416256412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110056 (or 110040 counting only the distinct ones).
The product of its digits is 691200, while the sum is 43.
The spelling of 453416256412 in words is "four hundred fifty-three billion, four hundred sixteen million, two hundred fifty-six thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •