Base | Representation |
---|---|
bin | 111101000000010111111100… |
… | …1100010110000101110100101 |
3 | 2121100222201012222020012122211 |
4 | 1322000233321202300232211 |
5 | 1030313332120020243323 |
6 | 5141140354005323421 |
7 | 221013006000100366 |
oct | 17200577142605645 |
9 | 2540881188205584 |
10 | 536613105634213 |
11 | 145a88381723823 |
12 | 5022726b406571 |
13 | 1a05652502906a |
14 | 96722da261b6d |
15 | 4208811d4870d |
hex | 1e80bf98b0ba5 |
536613105634213 has 2 divisors, whose sum is σ = 536613105634214. Its totient is φ = 536613105634212.
The previous prime is 536613105634181. The next prime is 536613105634223. The reversal of 536613105634213 is 312436501316635.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 363526007384164 + 173087098250049 = 19066358^2 + 13156257^2 .
It is a cyclic number.
It is not a de Polignac number, because 536613105634213 - 25 = 536613105634181 is a prime.
It is a super-2 number, since 2×5366131056342132 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (536613105634223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 268306552817106 + 268306552817107.
It is an arithmetic number, because the mean of its divisors is an integer number (268306552817107).
Almost surely, 2536613105634213 is an apocalyptic number.
It is an amenable number.
536613105634213 is a deficient number, since it is larger than the sum of its proper divisors (1).
536613105634213 is an equidigital number, since it uses as much as digits as its factorization.
536613105634213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3499200, while the sum is 49.
The spelling of 536613105634213 in words is "five hundred thirty-six trillion, six hundred thirteen billion, one hundred five million, six hundred thirty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •