Base | Representation |
---|---|
bin | 1110111100011111101010… |
… | …1010101011101010111101 |
3 | 2011011221001001220022211220 |
4 | 3233013322222223222331 |
5 | 4123212132040301000 |
6 | 54540544340103553 |
7 | 3314130364200342 |
oct | 357077252535275 |
9 | 64157031808756 |
10 | 16432455400125 |
11 | 5265a687532a6 |
12 | 1a14878094bb9 |
13 | 92275cb0370b |
14 | 40b49968a7c9 |
15 | 1d76a4c691a0 |
hex | ef1faaababd |
16432455400125 has 64 divisors (see below), whose sum is σ = 28013048114688. Its totient is φ = 8549449920000.
The previous prime is 16432455400121. The next prime is 16432455400147. The reversal of 16432455400125 is 52100455423461.
It is not a de Polignac number, because 16432455400125 - 22 = 16432455400121 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16432455400121) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 196619847 + ... + 196703403.
It is an arithmetic number, because the mean of its divisors is an integer number (437703876792).
Almost surely, 216432455400125 is an apocalyptic number.
16432455400125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
16432455400125 is a deficient number, since it is larger than the sum of its proper divisors (11580592714563).
16432455400125 is a wasteful number, since it uses less digits than its factorization.
16432455400125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96407 (or 96397 counting only the distinct ones).
The product of its (nonzero) digits is 576000, while the sum is 42.
The spelling of 16432455400125 in words is "sixteen trillion, four hundred thirty-two billion, four hundred fifty-five million, four hundred thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.331 sec. • engine limits •