Base | Representation |
---|---|
bin | 1110111101101110011100… |
… | …0110111111011011011000 |
3 | 2011020221121211011122202202 |
4 | 3233123213012333123120 |
5 | 4124033434120110430 |
6 | 54554402551345332 |
7 | 3315506412245225 |
oct | 357334706773330 |
9 | 64227554148682 |
10 | 16453602113240 |
11 | 5273a2a4a2906 |
12 | 1a1899a082248 |
13 | 92474cc36306 |
14 | 40c503d9094c |
15 | 1d7ee14e6d45 |
hex | ef6e71bf6d8 |
16453602113240 has 32 divisors (see below), whose sum is σ = 37021102678080. Its totient is φ = 6581352325632.
The previous prime is 16453602113173. The next prime is 16453602113293. The reversal of 16453602113240 is 4231120635461.
It is a junction number, because it is equal to n+sod(n) for n = 16453602113194 and 16453602113203.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 286529 + ... + 5743631.
It is an arithmetic number, because the mean of its divisors is an integer number (1156909458690).
Almost surely, 216453602113240 is an apocalyptic number.
16453602113240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16453602113240 is an abundant number, since it is smaller than the sum of its proper divisors (20567500564840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16453602113240 is a wasteful number, since it uses less digits than its factorization.
16453602113240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5532491 (or 5532487 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 16453602113240 in words is "sixteen trillion, four hundred fifty-three billion, six hundred two million, one hundred thirteen thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •