Base | Representation |
---|---|
bin | 100111011000001010100… |
… | …1111000000110111100101 |
3 | 201011101100122010021202202 |
4 | 1032300111033000313211 |
5 | 1202132301323101323 |
6 | 15302125000544245 |
7 | 1066001530622102 |
oct | 116602517006745 |
9 | 21141318107682 |
10 | 5412015050213 |
11 | 17a724a44aa22 |
12 | 734a74a82085 |
13 | 303473a06575 |
14 | 149d2b563aa9 |
15 | 95ba3d5ed28 |
hex | 4ec153c0de5 |
5412015050213 has 2 divisors, whose sum is σ = 5412015050214. Its totient is φ = 5412015050212.
The previous prime is 5412015050179. The next prime is 5412015050231. The reversal of 5412015050213 is 3120505102145.
Together with next prime (5412015050231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3663863030884 + 1748152019329 = 1914122^2 + 1322177^2 .
It is a cyclic number.
It is not a de Polignac number, because 5412015050213 - 214 = 5412015033829 is a prime.
It is a super-2 number, since 2×54120150502132 (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 (5412015050413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2706007525106 + 2706007525107.
It is an arithmetic number, because the mean of its divisors is an integer number (2706007525107).
Almost surely, 25412015050213 is an apocalyptic number.
It is an amenable number.
5412015050213 is a deficient number, since it is larger than the sum of its proper divisors (1).
5412015050213 is an equidigital number, since it uses as much as digits as its factorization.
5412015050213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6000, while the sum is 29.
The spelling of 5412015050213 in words is "five trillion, four hundred twelve billion, fifteen million, fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •