Base | Representation |
---|---|
bin | 10110110110111100100101… |
… | …11000001011100110011101 |
3 | 20120222102112110211021101211 |
4 | 23123132102320023212131 |
5 | 23042031210403404310 |
6 | 254524032414304421 |
7 | 13405426620131023 |
oct | 1333362270134635 |
9 | 216872473737354 |
10 | 50266466466205 |
11 | 1501a9859700a0 |
12 | 5779b89ab8111 |
13 | 22081520ab8a2 |
14 | c5aca4cd4713 |
15 | 5c282d3b1c8a |
hex | 2db792e0b99d |
50266466466205 has 64 divisors (see below), whose sum is σ = 67440938950656. Its totient is φ = 35653356160000.
The previous prime is 50266466466173. The next prime is 50266466466211.
50266466466205 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 50266466466205 - 25 = 50266466466173 is a prime.
It is a super-2 number, since 2×502664664662052 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50266466466205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1018938390 + ... + 1018987720.
It is an arithmetic number, because the mean of its divisors is an integer number (1053764671104).
Almost surely, 250266466466205 is an apocalyptic number.
50266466466205 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50266466466205 is a deficient number, since it is larger than the sum of its proper divisors (17174472484451).
50266466466205 is a wasteful number, since it uses less digits than its factorization.
50266466466205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50778.
The product of its (nonzero) digits is 74649600, while the sum is 58.
The spelling of 50266466466205 in words is "fifty trillion, two hundred sixty-six billion, four hundred sixty-six million, four hundred sixty-six thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •