Base | Representation |
---|---|
bin | 10110110000111110000100… |
… | …01001100001001011110000 |
3 | 20120020210110012200020211221 |
4 | 23120133002021201023300 |
5 | 23030200113341010000 |
6 | 254245430302114424 |
7 | 13354536516324061 |
oct | 1330370211411360 |
9 | 216223405606757 |
10 | 50061101110000 |
11 | 14a50880539412 |
12 | 574621557ba14 |
13 | 21c198432c136 |
14 | c50d82408568 |
15 | 5bc30ddb761a |
hex | 2d87c22612f0 |
50061101110000 has 100 divisors (see below), whose sum is σ = 122128148313864. Its totient is φ = 19871581600000.
The previous prime is 50061101109949. The next prime is 50061101110019. The reversal of 50061101110000 is 1110116005.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×500611011100002 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 17797291 + ... + 20417290.
Almost surely, 250061101110000 is an apocalyptic number.
50061101110000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50061101110000 is an abundant number, since it is smaller than the sum of its proper divisors (72067047203864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50061101110000 is a wasteful number, since it uses less digits than its factorization.
50061101110000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38214740 (or 38214719 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 16.
Adding to 50061101110000 its reverse (1110116005), we get a palindrome (50062211226005).
The spelling of 50061101110000 in words is "fifty trillion, sixty-one billion, one hundred one million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •