Base | Representation |
---|---|
bin | 10110110000000110100011… |
… | …11000110111111111011000 |
3 | 20120010221112100101220112101 |
4 | 23120003101320313333120 |
5 | 23024203100401130402 |
6 | 254224021225453144 |
7 | 13352433156502531 |
oct | 1330032170677730 |
9 | 216127470356471 |
10 | 50031300411352 |
11 | 14a3a178850447 |
12 | 57404993411b4 |
13 | 21bbc15338340 |
14 | c4d75663d688 |
15 | 5bb667a0ab87 |
hex | 2d80d1e37fd8 |
50031300411352 has 64 divisors (see below), whose sum is σ = 108256136899680. Its totient is φ = 21471209490432.
The previous prime is 50031300411329. The next prime is 50031300411353. The reversal of 50031300411352 is 25311400313005.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 50031300411352.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50031300411353) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 170324623 + ... + 170618110.
Almost surely, 250031300411352 is an apocalyptic number.
50031300411352 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
50031300411352 is an abundant number, since it is smaller than the sum of its proper divisors (58224836488328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50031300411352 is a wasteful number, since it uses less digits than its factorization.
50031300411352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340942852 (or 340942848 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 50031300411352 its reverse (25311400313005), we get a palindrome (75342700724357).
The spelling of 50031300411352 in words is "fifty trillion, thirty-one billion, three hundred million, four hundred eleven thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •