Base | Representation |
---|---|
bin | 101111100001110100… |
… | …001101100101101001 |
3 | 11212201120222012221121 |
4 | 233201310031211221 |
5 | 1314003444413001 |
6 | 35235550335241 |
7 | 3454436023366 |
oct | 574164154551 |
9 | 155646865847 |
10 | 51033201001 |
11 | 1a708a03282 |
12 | 9a82aba521 |
13 | 4a73b32b73 |
14 | 2681a4146d |
15 | 14da4336a1 |
hex | be1d0d969 |
51033201001 has 4 divisors (see below), whose sum is σ = 51142480272. Its totient is φ = 50923921732.
The previous prime is 51033200987. The next prime is 51033201007. The reversal of 51033201001 is 10010233015.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10010233015 = 5 ⋅2002046603.
It is a cyclic number.
It is not a de Polignac number, because 51033201001 - 227 = 50898983273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51033201007) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 54638935 + ... + 54639868.
It is an arithmetic number, because the mean of its divisors is an integer number (12785620068).
Almost surely, 251033201001 is an apocalyptic number.
It is an amenable number.
51033201001 is a deficient number, since it is larger than the sum of its proper divisors (109279271).
51033201001 is a wasteful number, since it uses less digits than its factorization.
51033201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109279270.
The product of its (nonzero) digits is 90, while the sum is 16.
Adding to 51033201001 its reverse (10010233015), we get a palindrome (61043434016).
The spelling of 51033201001 in words is "fifty-one billion, thirty-three million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •