Base | Representation |
---|---|
bin | 110100110001101101000110… |
… | …100110010100111110010111 |
3 | 1010102211220001212021101000021 |
4 | 310301231012212110332113 |
5 | 220410424140104431411 |
6 | 2141355425120130011 |
7 | 66614455554535261 |
oct | 6461550646247627 |
9 | 1112756055241007 |
10 | 232114102030231 |
11 | 67a60046437323 |
12 | 22049327166907 |
13 | 9c6935c2556c5 |
14 | 414654d756b31 |
15 | 1bc7c49119a71 |
hex | d31b46994f97 |
232114102030231 has 2 divisors, whose sum is σ = 232114102030232. Its totient is φ = 232114102030230.
The previous prime is 232114102030193. The next prime is 232114102030267. The reversal of 232114102030231 is 132030201411232.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 232114102030231 - 27 = 232114102030103 is a prime.
It is a super-2 number, since 2×2321141020302312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 232114102030196 and 232114102030205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232114102030331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116057051015115 + 116057051015116.
It is an arithmetic number, because the mean of its divisors is an integer number (116057051015116).
Almost surely, 2232114102030231 is an apocalyptic number.
232114102030231 is a deficient number, since it is larger than the sum of its proper divisors (1).
232114102030231 is an equidigital number, since it uses as much as digits as its factorization.
232114102030231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 232114102030231 its reverse (132030201411232), we get a palindrome (364144303441463).
The spelling of 232114102030231 in words is "two hundred thirty-two trillion, one hundred fourteen billion, one hundred two million, thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •