Base | Representation |
---|---|
bin | 1110111101100110011010… |
… | …0000111001010011011000 |
3 | 2011020202001110111211000202 |
4 | 3233121212200321103120 |
5 | 4124020024312034112 |
6 | 54553404521321332 |
7 | 3315402064121510 |
oct | 357314640712330 |
9 | 64222043454022 |
10 | 16451444643032 |
11 | 5273022681583 |
12 | 1a18497636248 |
13 | 924497c75b19 |
14 | 40c37b624840 |
15 | 1d7e16dcb6c2 |
hex | ef6668394d8 |
16451444643032 has 128 divisors (see below), whose sum is σ = 38178315379200. Its totient is φ = 6489702540288.
The previous prime is 16451444643017. The next prime is 16451444643043. The reversal of 16451444643032 is 23034644415461.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3623378 + ... + 6784670.
It is an arithmetic number, because the mean of its divisors is an integer number (298268088900).
Almost surely, 216451444643032 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 16451444643032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19089157689600).
16451444643032 is an abundant number, since it is smaller than the sum of its proper divisors (21726870736168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16451444643032 is a wasteful number, since it uses less digits than its factorization.
16451444643032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3161465 (or 3161461 counting only the distinct ones).
The product of its (nonzero) digits is 3317760, while the sum is 47.
The spelling of 16451444643032 in words is "sixteen trillion, four hundred fifty-one billion, four hundred forty-four million, six hundred forty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •