Base | Representation |
---|---|
bin | 100000110000100011110… |
… | …011101011100011010101 |
3 | 21222012122110111101120211 |
4 | 200300203303223203111 |
5 | 243340340341112042 |
6 | 4442100440525421 |
7 | 321432634664506 |
oct | 40604363534325 |
9 | 7865573441524 |
10 | 2251163613397 |
11 | 798793198aa6 |
12 | 30435a180871 |
13 | 13438c7177aa |
14 | 7ad57a3cbad |
15 | 3d858046017 |
hex | 20c23ceb8d5 |
2251163613397 has 2 divisors, whose sum is σ = 2251163613398. Its totient is φ = 2251163613396.
The previous prime is 2251163613329. The next prime is 2251163613401. The reversal of 2251163613397 is 7933163611522.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2247093938961 + 4069674436 = 1499031^2 + 63794^2 .
It is a cyclic number.
It is not a de Polignac number, because 2251163613397 - 211 = 2251163611349 is a prime.
It is a super-2 number, since 2×22511636133972 (a number of 26 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 2251163613397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2251163617397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1125581806698 + 1125581806699.
It is an arithmetic number, because the mean of its divisors is an integer number (1125581806699).
Almost surely, 22251163613397 is an apocalyptic number.
It is an amenable number.
2251163613397 is a deficient number, since it is larger than the sum of its proper divisors (1).
2251163613397 is an equidigital number, since it uses as much as digits as its factorization.
2251163613397 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1224720, while the sum is 49.
The spelling of 2251163613397 in words is "two trillion, two hundred fifty-one billion, one hundred sixty-three million, six hundred thirteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •