Base | Representation |
---|---|
bin | 10110111000111100011100… |
… | …11000011101110011000000 |
3 | 20121012222201101201111202121 |
4 | 23130132032120131303000 |
5 | 23044142301243120000 |
6 | 255015344110454024 |
7 | 13413406651015525 |
oct | 1334361630356300 |
9 | 217188641644677 |
10 | 50335110520000 |
11 | 15047000722769 |
12 | 578b346804314 |
13 | 22117716304b7 |
14 | c603377c514c |
15 | 5c44e9930b1a |
hex | 2dc78e61dcc0 |
50335110520000 has 140 divisors (see below), whose sum is σ = 124869375646576. Its totient is φ = 20125226880000.
The previous prime is 50335110519973. The next prime is 50335110520027. The reversal of 50335110520000 is 2501153305.
50335110520000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (50335110519973) and next prime (50335110520027).
It is a super-2 number, since 2×503351105200002 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
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 19 ways as a sum of consecutive naturals, for example, 91445605 + ... + 91994395.
Almost surely, 250335110520000 is an apocalyptic number.
50335110520000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50335110520000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62434687823288).
50335110520000 is an abundant number, since it is smaller than the sum of its proper divisors (74534265126576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50335110520000 is an equidigital number, since it uses as much as digits as its factorization.
50335110520000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 551116 (or 551091 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 25.
Adding to 50335110520000 its reverse (2501153305), we get a palindrome (50337611673305).
The spelling of 50335110520000 in words is "fifty trillion, three hundred thirty-five billion, one hundred ten million, five hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •