Base | Representation |
---|---|
bin | 10110110111011100000000… |
… | …01011000111110000011011 |
3 | 20121001001001220022020212120 |
4 | 23123232000023013300123 |
5 | 23042320231112031100 |
6 | 254535502152512323 |
7 | 13406564566261152 |
oct | 1333560013076033 |
9 | 217031056266776 |
10 | 50283332533275 |
11 | 150270503709a6 |
12 | 57812b63ab6a3 |
13 | 220990c40a32a |
14 | c5ba24cac599 |
15 | 5c2eb8e300a0 |
hex | 2dbb802c7c1b |
50283332533275 has 24 divisors (see below), whose sum is σ = 84497980448304. Its totient is φ = 26378141654400.
The previous prime is 50283332533267. The next prime is 50283332533277. The reversal of 50283332533275 is 57233523338205.
50283332533275 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 50283332533275 - 23 = 50283332533267 is a prime.
It is not an unprimeable number, because it can be changed into a prime (50283332533277) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 5495441604 + ... + 5495450753.
It is an arithmetic number, because the mean of its divisors is an integer number (3520749185346).
Almost surely, 250283332533275 is an apocalyptic number.
50283332533275 is a deficient number, since it is larger than the sum of its proper divisors (34214647915029).
50283332533275 is a wasteful number, since it uses less digits than its factorization.
50283332533275 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10990892431 (or 10990892426 counting only the distinct ones).
The product of its (nonzero) digits is 13608000, while the sum is 51.
The spelling of 50283332533275 in words is "fifty trillion, two hundred eighty-three billion, three hundred thirty-two million, five hundred thirty-three thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •