Base | Representation |
---|---|
bin | 10110110000101110000111… |
… | …00000101010100000010011 |
3 | 20120012222100011011222212120 |
4 | 23120113003200222200103 |
5 | 23030030042202120430 |
6 | 254241452223425323 |
7 | 13354114311263454 |
oct | 1330270340524023 |
9 | 216188304158776 |
10 | 50052534020115 |
11 | 14a48184650a40 |
12 | 5744624455243 |
13 | 21c0c1a473b93 |
14 | c507ac6c312b |
15 | 5bbeabc00610 |
hex | 2d85c382a813 |
50052534020115 has 16 divisors (see below), whose sum is σ = 87364423017216. Its totient is φ = 24267895282400.
The previous prime is 50052534020089. The next prime is 50052534020191. The reversal of 50052534020115 is 51102043525005.
It is not a de Polignac number, because 50052534020115 - 215 = 50052533987347 is a prime.
It is a super-2 number, since 2×500525340201152 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 151674345351 + ... + 151674345680.
It is an arithmetic number, because the mean of its divisors is an integer number (5460276438576).
Almost surely, 250052534020115 is an apocalyptic number.
50052534020115 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
50052534020115 is a deficient number, since it is larger than the sum of its proper divisors (37311888997101).
50052534020115 is a wasteful number, since it uses less digits than its factorization.
50052534020115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303348691050.
The product of its (nonzero) digits is 30000, while the sum is 33.
The spelling of 50052534020115 in words is "fifty trillion, fifty-two billion, five hundred thirty-four million, twenty thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •