Base | Representation |
---|---|
bin | 101111111110010111… |
… | …100100110000110101 |
3 | 11220221222100120022222 |
4 | 233332113210300311 |
5 | 1320444112424023 |
6 | 35355301532125 |
7 | 3502343520233 |
oct | 577627446065 |
9 | 156858316288 |
10 | 51512233013 |
11 | 1a9343490aa |
12 | 9b97414045 |
13 | 4b1c156067 |
14 | 26c94d9953 |
15 | 1517508cc8 |
hex | bfe5e4c35 |
51512233013 has 4 divisors (see below), whose sum is σ = 53288516940. Its totient is φ = 49735949088.
The previous prime is 51512232973. The next prime is 51512233027. The reversal of 51512233013 is 31033221515.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31033221515 = 5 ⋅6206644303.
It can be written as a sum of positive squares in 2 ways, for example, as 37949767249 + 13562465764 = 194807^2 + 116458^2 .
It is a cyclic number.
It is not a de Polignac number, because 51512233013 - 26 = 51512232949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51512233093) 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, 888141920 + ... + 888141977.
It is an arithmetic number, because the mean of its divisors is an integer number (13322129235).
Almost surely, 251512233013 is an apocalyptic number.
It is an amenable number.
51512233013 is a deficient number, since it is larger than the sum of its proper divisors (1776283927).
51512233013 is a wasteful number, since it uses less digits than its factorization.
51512233013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1776283926.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 51512233013 its reverse (31033221515), we get a palindrome (82545454528).
The spelling of 51512233013 in words is "fifty-one billion, five hundred twelve million, two hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •