Base | Representation |
---|---|
bin | 101110111111111110… |
… | …101001100110101111 |
3 | 11211021000202121211200 |
4 | 232333332221212233 |
5 | 1311323132334410 |
6 | 35103351020543 |
7 | 3434403526113 |
oct | 567776514657 |
9 | 154230677750 |
10 | 50465511855 |
11 | 1a447513aa0 |
12 | 994496a753 |
13 | 49b333b025 |
14 | 262a4a9743 |
15 | 14a56993c0 |
hex | bbffa99af |
50465511855 has 48 divisors (see below), whose sum is σ = 95473123200. Its totient is φ = 24455966400.
The previous prime is 50465511851. The next prime is 50465511869. The reversal of 50465511855 is 55811556405.
50465511855 is a `hidden beast` number, since 5 + 0 + 46 + 551 + 1 + 8 + 55 = 666.
It is not a de Polignac number, because 50465511855 - 22 = 50465511851 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 50465511855.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50465511851) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1014720 + ... + 1063290.
It is an arithmetic number, because the mean of its divisors is an integer number (1989023400).
Almost surely, 250465511855 is an apocalyptic number.
50465511855 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
50465511855 is a deficient number, since it is larger than the sum of its proper divisors (45007611345).
50465511855 is a wasteful number, since it uses less digits than its factorization.
50465511855 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50692 (or 50689 counting only the distinct ones).
The product of its (nonzero) digits is 600000, while the sum is 45.
The spelling of 50465511855 in words is "fifty billion, four hundred sixty-five million, five hundred eleven thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •