Base | Representation |
---|---|
bin | 10110110000000000111000… |
… | …00011010100010000010000 |
3 | 20120010122122201221110210001 |
4 | 23120000130003110100100 |
5 | 23024130323410221443 |
6 | 254222354410215344 |
7 | 13352264444030506 |
oct | 1330003403242020 |
9 | 216118581843701 |
10 | 50028249695248 |
11 | 14a389527a0270 |
12 | 573b987724554 |
13 | 21bb84a2a7796 |
14 | c4d5473d4676 |
15 | 5bb539c99d4d |
hex | 2d801c0d4410 |
50028249695248 has 80 divisors (see below), whose sum is σ = 107195287276800. Its totient is φ = 22427507543040.
The previous prime is 50028249695201. The next prime is 50028249695257. The reversal of 50028249695248 is 84259694282005.
It is a self number, because there is not a number n which added to its sum of digits gives 50028249695248.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 299004958 + ... + 299172226.
It is an arithmetic number, because the mean of its divisors is an integer number (1339941090960).
Almost surely, 250028249695248 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 50028249695248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53597643638400).
50028249695248 is an abundant number, since it is smaller than the sum of its proper divisors (57167037581552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50028249695248 is a wasteful number, since it uses less digits than its factorization.
50028249695248 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190640 (or 190634 counting only the distinct ones).
The product of its (nonzero) digits is 99532800, while the sum is 64.
The spelling of 50028249695248 in words is "fifty trillion, twenty-eight billion, two hundred forty-nine million, six hundred ninety-five thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •