Base | Representation |
---|---|
bin | 100010001010110111000… |
… | …011110010111100101001 |
3 | 22022110220202101022220201 |
4 | 202022313003302330221 |
5 | 301432424040304012 |
6 | 4554414000552201 |
7 | 331434454214461 |
oct | 42126703627451 |
9 | 8273822338821 |
10 | 2348123369257 |
11 | 825919476736 |
12 | 31b0b9922661 |
13 | 1405723c1cb3 |
14 | 81914dbcba1 |
15 | 411303dc857 |
hex | 222b70f2f29 |
2348123369257 has 2 divisors, whose sum is σ = 2348123369258. Its totient is φ = 2348123369256.
The previous prime is 2348123369201. The next prime is 2348123369299. The reversal of 2348123369257 is 7529633218432.
2348123369257 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2271543322896 + 76580046361 = 1507164^2 + 276731^2 .
It is a cyclic number.
It is not a de Polignac number, because 2348123369257 - 231 = 2345975885609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2348123369198 and 2348123369207.
It is not a weakly prime, because it can be changed into another prime (2348123369057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1174061684628 + 1174061684629.
It is an arithmetic number, because the mean of its divisors is an integer number (1174061684629).
Almost surely, 22348123369257 is an apocalyptic number.
It is an amenable number.
2348123369257 is a deficient number, since it is larger than the sum of its proper divisors (1).
2348123369257 is an equidigital number, since it uses as much as digits as its factorization.
2348123369257 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13063680, while the sum is 55.
The spelling of 2348123369257 in words is "two trillion, three hundred forty-eight billion, one hundred twenty-three million, three hundred sixty-nine thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •