Base | Representation |
---|---|
bin | 10111011000111001101001… |
… | …01001100100111011100000 |
3 | 20202002221212100000220200120 |
4 | 23230130310221210323200 |
5 | 23220140010332342000 |
6 | 301220014141320240 |
7 | 13555630402303242 |
oct | 1354346451447340 |
9 | 222087770026616 |
10 | 51433116684000 |
11 | 1542a731567207 |
12 | 59280ba866080 |
13 | 229117830bc4c |
14 | c9b53a15a092 |
15 | 5e2d6033a6a0 |
hex | 2ec734a64ee0 |
51433116684000 has 192 divisors, whose sum is σ = 178406355097152. Its totient is φ = 12908703744000.
The previous prime is 51433116683989. The next prime is 51433116684043. The reversal of 51433116684000 is 48661133415.
51433116684000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 125857561 + ... + 126265560.
It is an arithmetic number, because the mean of its divisors is an integer number (929199766131).
Almost surely, 251433116684000 is an apocalyptic number.
51433116684000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
51433116684000 is an abundant number, since it is smaller than the sum of its proper divisors (126973238413152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51433116684000 is a wasteful number, since it uses less digits than its factorization.
51433116684000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252123166 (or 252123148 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 42.
The spelling of 51433116684000 in words is "fifty-one trillion, four hundred thirty-three billion, one hundred sixteen million, six hundred eighty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •