Base | Representation |
---|---|
bin | 10111000000110011010001… |
… | …01001111101000110010100 |
3 | 20122011210111200020212110002 |
4 | 23200121220221331012110 |
5 | 23113103130442310400 |
6 | 255343351023550432 |
7 | 13442044401043655 |
oct | 1340315051750624 |
9 | 218153450225402 |
10 | 50605060510100 |
11 | 15140538428838 |
12 | 581372445b418 |
13 | 2231062907255 |
14 | c6d4259c152c |
15 | 5cb548dd7ed5 |
hex | 2e0668a7d194 |
50605060510100 has 36 divisors (see below), whose sum is σ = 116272568446524. Its totient is φ = 19051316897280.
The previous prime is 50605060510093. The next prime is 50605060510237. The reversal of 50605060510100 is 101506050605.
It can be written as a sum of positive squares in 6 ways, for example, as 96009501316 + 50509051008784 = 309854^2 + 7106972^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14883839627 + ... + 14883843026.
It is an arithmetic number, because the mean of its divisors is an integer number (3229793567959).
Almost surely, 250605060510100 is an apocalyptic number.
50605060510100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50605060510100 is an abundant number, since it is smaller than the sum of its proper divisors (65667507936424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50605060510100 is a wasteful number, since it uses less digits than its factorization.
50605060510100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29767682684 (or 29767682677 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 50605060510100 its reverse (101506050605), we get a palindrome (50706566560705).
The spelling of 50605060510100 in words is "fifty trillion, six hundred five billion, sixty million, five hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •