Base | Representation |
---|---|
bin | 110100110011000101111010… |
… | …100100000101101100101111 |
3 | 1010110012000012202000121222001 |
4 | 310303011322210011230233 |
5 | 220414004440030422434 |
6 | 2141511315451433131 |
7 | 66624402652562014 |
oct | 6463057244055457 |
9 | 1113160182017861 |
10 | 232209463139119 |
11 | 67a97531287914 |
12 | 220638bb4557a7 |
13 | 9c7534897bc5b |
14 | 414add867570b |
15 | 1bca47ae7d114 |
hex | d3317a905b2f |
232209463139119 has 2 divisors, whose sum is σ = 232209463139120. Its totient is φ = 232209463139118.
The previous prime is 232209463139117. The next prime is 232209463139153. The reversal of 232209463139119 is 911931364902232.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 232209463139119 - 21 = 232209463139117 is a prime.
It is a super-2 number, since 2×2322094631391192 (a number of 30 digits) contains 22 as substring.
Together with 232209463139117, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 232209463139119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232209463139117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116104731569559 + 116104731569560.
It is an arithmetic number, because the mean of its divisors is an integer number (116104731569560).
Almost surely, 2232209463139119 is an apocalyptic number.
232209463139119 is a deficient number, since it is larger than the sum of its proper divisors (1).
232209463139119 is an equidigital number, since it uses as much as digits as its factorization.
232209463139119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3779136, while the sum is 55.
The spelling of 232209463139119 in words is "two hundred thirty-two trillion, two hundred nine billion, four hundred sixty-three million, one hundred thirty-nine thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •