Base | Representation |
---|---|
bin | 110100110010100100010101… |
… | …111010110010000000110101 |
3 | 1010110001120011110210211112112 |
4 | 310302210111322302000311 |
5 | 220412412123200204423 |
6 | 2141442554435500405 |
7 | 66621655441305665 |
oct | 6462442572620065 |
9 | 1113046143724475 |
10 | 232173414850613 |
11 | 67a83212a31145 |
12 | 2205891aa57705 |
13 | 9c71b22511a22 |
14 | 4149378c4c1a5 |
15 | 1bc956b37da78 |
hex | d32915eb2035 |
232173414850613 has 2 divisors, whose sum is σ = 232173414850614. Its totient is φ = 232173414850612.
The previous prime is 232173414850561. The next prime is 232173414850631. The reversal of 232173414850613 is 316058414371232.
Together with next prime (232173414850631) 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., 182775879808369 + 49397535042244 = 13519463^2 + 7028338^2 .
It is a cyclic number.
It is not a de Polignac number, because 232173414850613 - 242 = 227775368339509 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232173414850213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116086707425306 + 116086707425307.
It is an arithmetic number, because the mean of its divisors is an integer number (116086707425307).
Almost surely, 2232173414850613 is an apocalyptic number.
It is an amenable number.
232173414850613 is a deficient number, since it is larger than the sum of its proper divisors (1).
232173414850613 is an equidigital number, since it uses as much as digits as its factorization.
232173414850613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2903040, while the sum is 50.
The spelling of 232173414850613 in words is "two hundred thirty-two trillion, one hundred seventy-three billion, four hundred fourteen million, eight hundred fifty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •