Base | Representation |
---|---|
bin | 100000111101101110011… |
… | …110101110110111101011 |
3 | 22000120010202002001022121 |
4 | 200331232132232313223 |
5 | 244103314114040201 |
6 | 4452355352532111 |
7 | 322443164321545 |
oct | 40755636566753 |
9 | 8016122061277 |
10 | 2265301315051 |
11 | 7a3788599555 |
12 | 3070449b1037 |
13 | 13580370a828 |
14 | 7b8d951c695 |
15 | 3ddd42c99a1 |
hex | 20f6e7aedeb |
2265301315051 has 2 divisors, whose sum is σ = 2265301315052. Its totient is φ = 2265301315050.
The previous prime is 2265301314973. The next prime is 2265301315093. The reversal of 2265301315051 is 1505131035622.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2265301315051 - 213 = 2265301306859 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2265301314998 and 2265301315016.
It is not a weakly prime, because it can be changed into another prime (2265301315951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1132650657525 + 1132650657526.
It is an arithmetic number, because the mean of its divisors is an integer number (1132650657526).
Almost surely, 22265301315051 is an apocalyptic number.
2265301315051 is a deficient number, since it is larger than the sum of its proper divisors (1).
2265301315051 is an equidigital number, since it uses as much as digits as its factorization.
2265301315051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 34.
The spelling of 2265301315051 in words is "two trillion, two hundred sixty-five billion, three hundred one million, three hundred fifteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •