Base | Representation |
---|---|
bin | 101110100111001101… |
… | …110101001011110000 |
3 | 11210012002000112110110 |
4 | 232213031311023300 |
5 | 1310000303423130 |
6 | 34554230301320 |
7 | 3421200333210 |
oct | 564715651360 |
9 | 153162015413 |
10 | 50050061040 |
11 | 1a253a55711 |
12 | 98497b7840 |
13 | 4948249b45 |
14 | 25cb242240 |
15 | 147de82ab0 |
hex | ba73752f0 |
50050061040 has 160 divisors (see below), whose sum is σ = 177390360576. Its totient is φ = 11435489280.
The previous prime is 50050061023. The next prime is 50050061051. The reversal of 50050061040 is 4016005005.
It is a happy number.
It is a super-2 number, since 2×500500610402 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 50050060998 and 50050061016.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6166585 + ... + 6174695.
Almost surely, 250050061040 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 50050061040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88695180288).
50050061040 is an abundant number, since it is smaller than the sum of its proper divisors (127340299536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50050061040 is a wasteful number, since it uses less digits than its factorization.
50050061040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11807 (or 11801 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
Adding to 50050061040 its reverse (4016005005), we get a palindrome (54066066045).
The spelling of 50050061040 in words is "fifty billion, fifty million, sixty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •