Base | Representation |
---|---|
bin | 10111000010001000110111… |
… | …10110001011101011001100 |
3 | 20122100012010102120120001020 |
4 | 23201010123312023223030 |
5 | 23114331240211311111 |
6 | 255420431124314140 |
7 | 13445262256435266 |
oct | 1341043366135314 |
9 | 218305112516036 |
10 | 50651016510156 |
11 | 15158a80394877 |
12 | 582060ab42950 |
13 | 22354a78bb1aa |
14 | c717451c6b36 |
15 | 5cc838715906 |
hex | 2e111bd8bacc |
50651016510156 has 24 divisors (see below), whose sum is σ = 118804478521344. Its totient is φ = 16795275979920.
The previous prime is 50651016510103. The next prime is 50651016510169. The reversal of 50651016510156 is 65101561015605.
50651016510156 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×506510165101562 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11049521380 + ... + 11049525963.
It is an arithmetic number, because the mean of its divisors is an integer number (4950186605056).
Almost surely, 250651016510156 is an apocalyptic number.
It is an amenable number.
50651016510156 is an abundant number, since it is smaller than the sum of its proper divisors (68153462011188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50651016510156 is a wasteful number, since it uses less digits than its factorization.
50651016510156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22099047541 (or 22099047539 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 42.
The spelling of 50651016510156 in words is "fifty trillion, six hundred fifty-one billion, sixteen million, five hundred ten thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •