Base | Representation |
---|---|
bin | 10111011000010110001110… |
… | …10110111100110011100011 |
3 | 20202001010210020211122000021 |
4 | 23230023013112330303203 |
5 | 23214332040410342311 |
6 | 301203151332534311 |
7 | 13554355256423053 |
oct | 1354130726746343 |
9 | 222033706748007 |
10 | 51414103215331 |
11 | 154226649a183a |
12 | 5924493181397 |
13 | 228c438136b7c |
14 | c9a654cb7563 |
15 | 5e25eaee0171 |
hex | 2ec2c75bcce3 |
51414103215331 has 4 divisors (see below), whose sum is σ = 52256957366464. Its totient is φ = 50571249064200.
The previous prime is 51414103215313. The next prime is 51414103215337. The reversal of 51414103215331 is 13351230141415.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 51414103215331 - 219 = 51414102691043 is a prime.
It is a super-2 number, since 2×514141032153312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (51414103215337) 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, 421427075475 + ... + 421427075596.
It is an arithmetic number, because the mean of its divisors is an integer number (13064239341616).
Almost surely, 251414103215331 is an apocalyptic number.
51414103215331 is a deficient number, since it is larger than the sum of its proper divisors (842854151133).
51414103215331 is an equidigital number, since it uses as much as digits as its factorization.
51414103215331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 842854151132.
The product of its (nonzero) digits is 21600, while the sum is 34.
Adding to 51414103215331 its reverse (13351230141415), we get a palindrome (64765333356746).
The spelling of 51414103215331 in words is "fifty-one trillion, four hundred fourteen billion, one hundred three million, two hundred fifteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •