Base | Representation |
---|---|
bin | 10111001100101001110101… |
… | …01100001001000001010001 |
3 | 20200121201200200022200121000 |
4 | 23212110322230021001101 |
5 | 23141241203133140101 |
6 | 300254422100052213 |
7 | 13513342425022512 |
oct | 1346247254110121 |
9 | 220551620280530 |
10 | 51012311224401 |
11 | 152882218860aa |
12 | 587a63b994069 |
13 | 2260595481087 |
14 | c8501ab24a09 |
15 | 5d6e32121486 |
hex | 2e653ab09051 |
51012311224401 has 32 divisors (see below), whose sum is σ = 77617073705600. Its totient is φ = 33088749428160.
The previous prime is 51012311224393. The next prime is 51012311224447. The reversal of 51012311224401 is 10442211321015.
51012311224401 is a `hidden beast` number, since 5 + 1 + 0 + 1 + 2 + 31 + 1 + 224 + 401 = 666.
It is not a de Polignac number, because 51012311224401 - 23 = 51012311224393 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (51012311224801) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 150268866 + ... + 150607956.
It is an arithmetic number, because the mean of its divisors is an integer number (2425533553300).
Almost surely, 251012311224401 is an apocalyptic number.
It is an amenable number.
51012311224401 is a deficient number, since it is larger than the sum of its proper divisors (26604762481199).
51012311224401 is a wasteful number, since it uses less digits than its factorization.
51012311224401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 489726 (or 489720 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
Adding to 51012311224401 its reverse (10442211321015), we get a palindrome (61454522545416).
The spelling of 51012311224401 in words is "fifty-one trillion, twelve billion, three hundred eleven million, two hundred twenty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •