Base | Representation |
---|---|
bin | 10110110110100110000111… |
… | …01111011011010111110000 |
3 | 20120221021101122012000210121 |
4 | 23123103003233123113300 |
5 | 23041332003221300300 |
6 | 254514315301140024 |
7 | 13404521625303322 |
oct | 1333230357332760 |
9 | 216837348160717 |
10 | 50254401353200 |
11 | 15015854486120 |
12 | 57777813ba614 |
13 | 2206c7b5c9a75 |
14 | c5a47c7a7612 |
15 | 5c237407d81a |
hex | 2db4c3bdb5f0 |
50254401353200 has 240 divisors, whose sum is σ = 135760475443104. Its totient is φ = 17716221849600.
The previous prime is 50254401353197. The next prime is 50254401353227. The reversal of 50254401353200 is 235310445205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 44538402 + ... + 45652798.
Almost surely, 250254401353200 is an apocalyptic number.
50254401353200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50254401353200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67880237721552).
50254401353200 is an abundant number, since it is smaller than the sum of its proper divisors (85506074089904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50254401353200 is a wasteful number, since it uses less digits than its factorization.
50254401353200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1114740 (or 1114729 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 34.
Adding to 50254401353200 its reverse (235310445205), we get a palindrome (50489711798405).
The spelling of 50254401353200 in words is "fifty trillion, two hundred fifty-four billion, four hundred one million, three hundred fifty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •