Base | Representation |
---|---|
bin | 100101100010001100100… |
… | …0000001110100001111101 |
3 | 200021011102221112002111012 |
4 | 1023010121000032201331 |
5 | 1134004431323244123 |
6 | 14545510201005005 |
7 | 1041462531545642 |
oct | 113043100164175 |
9 | 20234387462435 |
10 | 5158675212413 |
11 | 1709866742148 |
12 | 6b3951a83765 |
13 | 2b55cba275b8 |
14 | 13b977365dc9 |
15 | 8e2c7c24378 |
hex | 4b11900e87d |
5158675212413 has 2 divisors, whose sum is σ = 5158675212414. Its totient is φ = 5158675212412.
The previous prime is 5158675212403. The next prime is 5158675212463. The reversal of 5158675212413 is 3142125768515.
It is an a-pointer prime, because the next prime (5158675212463) can be obtained adding 5158675212413 to its sum of digits (50).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4880374650649 + 278300561764 = 2209157^2 + 527542^2 .
It is a cyclic number.
It is not a de Polignac number, because 5158675212413 - 212 = 5158675208317 is a prime.
It is a super-2 number, since 2×51586752124132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5158675212403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2579337606206 + 2579337606207.
It is an arithmetic number, because the mean of its divisors is an integer number (2579337606207).
Almost surely, 25158675212413 is an apocalyptic number.
It is an amenable number.
5158675212413 is a deficient number, since it is larger than the sum of its proper divisors (1).
5158675212413 is an equidigital number, since it uses as much as digits as its factorization.
5158675212413 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2016000, while the sum is 50.
The spelling of 5158675212413 in words is "five trillion, one hundred fifty-eight billion, six hundred seventy-five million, two hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •