Base | Representation |
---|---|
bin | 10110111001001101011110… |
… | …10000110111011001000000 |
3 | 20121020212022111020102021211 |
4 | 23130212233100313121000 |
5 | 23044320012020013100 |
6 | 255023455150455504 |
7 | 13414152333162553 |
oct | 1334465720673100 |
9 | 217225274212254 |
10 | 50344252110400 |
11 | 1504a971931956 |
12 | 5791078204594 |
13 | 221259a5269a1 |
14 | c6096393669a |
15 | 5c488227a1ba |
hex | 2dc9af437640 |
50344252110400 has 84 divisors (see below), whose sum is σ = 124252581415600. Its totient is φ = 20076861657600.
The previous prime is 50344252110331. The next prime is 50344252110421. The reversal of 50344252110400 is 401125244305.
50344252110400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11 ways as a sum of consecutive naturals, for example, 47000850 + ... + 48060049.
Almost surely, 250344252110400 is an apocalyptic number.
50344252110400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50344252110400 is an abundant number, since it is smaller than the sum of its proper divisors (73908329305200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50344252110400 is a wasteful number, since it uses less digits than its factorization.
50344252110400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95061252 (or 95061237 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 50344252110400 its reverse (401125244305), we get a palindrome (50745377354705).
The spelling of 50344252110400 in words is "fifty trillion, three hundred forty-four billion, two hundred fifty-two million, one hundred ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •