Base | Representation |
---|---|
bin | 10110111000110011011101… |
… | …01000000111001000101011 |
3 | 20121012112020221111001222201 |
4 | 23130121232220013020223 |
5 | 23044102404343031100 |
6 | 255013225051401031 |
7 | 13413146216644405 |
oct | 1334315650071053 |
9 | 217175227431881 |
10 | 50330282783275 |
11 | 15044a53583700 |
12 | 578a419a53177 |
13 | 2211182397151 |
14 | c5ddda565b75 |
15 | 5c4315ba536a |
hex | 2dc66ea0722b |
50330282783275 has 36 divisors (see below), whose sum is σ = 69035864071216. Its totient is φ = 36370696190400.
The previous prime is 50330282783203. The next prime is 50330282783323. The reversal of 50330282783275 is 57238728203305.
50330282783275 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 50330282783275 - 221 = 50330280686123 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (55).
It is a Duffinian number.
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 35 ways as a sum of consecutive naturals, for example, 52512687 + ... + 53462536.
Almost surely, 250330282783275 is an apocalyptic number.
50330282783275 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
50330282783275 is a deficient number, since it is larger than the sum of its proper divisors (18705581287941).
50330282783275 is a wasteful number, since it uses less digits than its factorization.
50330282783275 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105975412 (or 105975396 counting only the distinct ones).
The product of its (nonzero) digits is 16934400, while the sum is 55.
The spelling of 50330282783275 in words is "fifty trillion, three hundred thirty billion, two hundred eighty-two million, seven hundred eighty-three thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •