Base | Representation |
---|---|
bin | 101101001011001000000… |
… | …110110000101100011111 |
3 | 101222202210122112102022211 |
4 | 231023020012300230133 |
5 | 401330123320300411 |
6 | 10334035004221251 |
7 | 440165014152604 |
oct | 55131006605437 |
9 | 11882718472284 |
10 | 3104323603231 |
11 | a97599820994 |
12 | 42177b83a827 |
13 | 196976004346 |
14 | aa3702666ab |
15 | 55b3d326221 |
hex | 2d2c81b0b1f |
3104323603231 has 2 divisors, whose sum is σ = 3104323603232. Its totient is φ = 3104323603230.
The previous prime is 3104323603229. The next prime is 3104323603259. The reversal of 3104323603231 is 1323063234013.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3104323603231 - 21 = 3104323603229 is a prime.
It is a super-2 number, since 2×31043236032312 (a number of 26 digits) contains 22 as substring.
Together with 3104323603229, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 3104323603193 and 3104323603202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3104323603331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1552161801615 + 1552161801616.
It is an arithmetic number, because the mean of its divisors is an integer number (1552161801616).
Almost surely, 23104323603231 is an apocalyptic number.
3104323603231 is a deficient number, since it is larger than the sum of its proper divisors (1).
3104323603231 is an equidigital number, since it uses as much as digits as its factorization.
3104323603231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23328, while the sum is 31.
Adding to 3104323603231 its reverse (1323063234013), we get a palindrome (4427386837244).
The spelling of 3104323603231 in words is "three trillion, one hundred four billion, three hundred twenty-three million, six hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.559 sec. • engine limits •