Base | Representation |
---|---|
bin | 100010001111011111110… |
… | …100001111100101010101 |
3 | 22022221202201210100101021 |
4 | 202033133310033211111 |
5 | 302023123121003042 |
6 | 5001000013001141 |
7 | 332002031022502 |
oct | 42173764174525 |
9 | 8287681710337 |
10 | 2353102125397 |
11 | 827a43893931 |
12 | 3200691831b1 |
13 | 140b86a2324a |
14 | 81c683104a9 |
15 | 41322549867 |
hex | 223dfd0f955 |
2353102125397 has 2 divisors, whose sum is σ = 2353102125398. Its totient is φ = 2353102125396.
The previous prime is 2353102125379. The next prime is 2353102125421. The reversal of 2353102125397 is 7935212013532.
Together with previous prime (2353102125379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1853480753476 + 499621371921 = 1361426^2 + 706839^2 .
It is a cyclic number.
It is not a de Polignac number, because 2353102125397 - 227 = 2352967907669 is a prime.
It is a super-2 number, since 2×23531021253972 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2353102129397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1176551062698 + 1176551062699.
It is an arithmetic number, because the mean of its divisors is an integer number (1176551062699).
Almost surely, 22353102125397 is an apocalyptic number.
It is an amenable number.
2353102125397 is a deficient number, since it is larger than the sum of its proper divisors (1).
2353102125397 is an equidigital number, since it uses as much as digits as its factorization.
2353102125397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 340200, while the sum is 43.
The spelling of 2353102125397 in words is "two trillion, three hundred fifty-three billion, one hundred two million, one hundred twenty-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •