Base | Representation |
---|---|
bin | 100001100000111100000… |
… | …101100001100110111101 |
3 | 22011011201201211021212201 |
4 | 201200330011201212331 |
5 | 300213232300130442 |
6 | 4522011232031501 |
7 | 325252140454213 |
oct | 41407405414675 |
9 | 8134651737781 |
10 | 2303110551997 |
11 | 80881a956912 |
12 | 312437092591 |
13 | 13924a943b98 |
14 | 7d684b74cb3 |
15 | 3ed987bb7b7 |
hex | 2183c1619bd |
2303110551997 has 2 divisors, whose sum is σ = 2303110551998. Its totient is φ = 2303110551996.
The previous prime is 2303110551991. The next prime is 2303110552003. The reversal of 2303110551997 is 7991550113032.
It is a balanced prime because it is at equal distance from previous prime (2303110551991) and next prime (2303110552003).
It can be written as a sum of positive squares in only one way, i.e., 1481366488996 + 821744063001 = 1217114^2 + 906501^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2303110551997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2303110551991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1151555275998 + 1151555275999.
It is an arithmetic number, because the mean of its divisors is an integer number (1151555275999).
Almost surely, 22303110551997 is an apocalyptic number.
It is an amenable number.
2303110551997 is a deficient number, since it is larger than the sum of its proper divisors (1).
2303110551997 is an equidigital number, since it uses as much as digits as its factorization.
2303110551997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 255150, while the sum is 46.
The spelling of 2303110551997 in words is "two trillion, three hundred three billion, one hundred ten million, five hundred fifty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •