Base | Representation |
---|---|
bin | 110100101001000011110011… |
… | …011111011010100011111011 |
3 | 1010100202002121000200010111101 |
4 | 310221003303133122203323 |
5 | 220321210431032103311 |
6 | 2140222453135312231 |
7 | 66523524324513424 |
oct | 6451036337324373 |
9 | 1110662530603441 |
10 | 231520002222331 |
11 | 678510995a4449 |
12 | 21b7216437b677 |
13 | 9c2531cab9a34 |
14 | 41258b0d4064b |
15 | 1bb757726bec1 |
hex | d290f37da8fb |
231520002222331 has 2 divisors, whose sum is σ = 231520002222332. Its totient is φ = 231520002222330.
The previous prime is 231520002222287. The next prime is 231520002222337. The reversal of 231520002222331 is 133222200025132.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-231520002222331 is a prime.
It is a super-2 number, since 2×2315200022223312 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 231520002222331.
It is not a weakly prime, because it can be changed into another prime (231520002222337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115760001111165 + 115760001111166.
It is an arithmetic number, because the mean of its divisors is an integer number (115760001111166).
Almost surely, 2231520002222331 is an apocalyptic number.
231520002222331 is a deficient number, since it is larger than the sum of its proper divisors (1).
231520002222331 is an equidigital number, since it uses as much as digits as its factorization.
231520002222331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 231520002222331 its reverse (133222200025132), we get a palindrome (364742202247463).
The spelling of 231520002222331 in words is "two hundred thirty-one trillion, five hundred twenty billion, two million, two hundred twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •