Base | Representation |
---|---|
bin | 101111111110100010… |
… | …101000100111110001 |
3 | 11220222011210212112201 |
4 | 233332202220213301 |
5 | 1321000333214101 |
6 | 35355444023201 |
7 | 3502410254245 |
oct | 577642504761 |
9 | 156864725481 |
10 | 51515132401 |
11 | 1a935a49497 |
12 | 9b98391b01 |
13 | 4b1c92c985 |
14 | 26c9a52425 |
15 | 15178cce01 |
hex | bfe8a89f1 |
51515132401 has 4 divisors (see below), whose sum is σ = 51515666032. Its totient is φ = 51514598772.
The previous prime is 51515132369. The next prime is 51515132407. The reversal of 51515132401 is 10423151515.
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 a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 51515132401 - 25 = 51515132369 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51515132401.
It is not an unprimeable number, because it can be changed into a prime (51515132407) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76995 + ... + 330088.
It is an arithmetic number, because the mean of its divisors is an integer number (12878916508).
Almost surely, 251515132401 is an apocalyptic number.
It is an amenable number.
51515132401 is a deficient number, since it is larger than the sum of its proper divisors (533631).
51515132401 is a wasteful number, since it uses less digits than its factorization.
51515132401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 533630.
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 51515132401 its reverse (10423151515), we get a palindrome (61938283916).
The spelling of 51515132401 in words is "fifty-one billion, five hundred fifteen million, one hundred thirty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •