Base | Representation |
---|---|
bin | 100001011110100111101… |
… | …001010010101000011101 |
3 | 22010221022011122101001212 |
4 | 201132213221102220131 |
5 | 300143132222411103 |
6 | 4520520145314205 |
7 | 325133340246236 |
oct | 41364751225035 |
9 | 8127264571055 |
10 | 2300620122653 |
11 | 80776209a446 |
12 | 311a61035965 |
13 | 138c419b5a58 |
14 | 7d4ca0d608d |
15 | 3ec9ed317d8 |
hex | 217a7a52a1d |
2300620122653 has 2 divisors, whose sum is σ = 2300620122654. Its totient is φ = 2300620122652.
The previous prime is 2300620122641. The next prime is 2300620122721. The reversal of 2300620122653 is 3562210260032.
2300620122653 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1515762332569 + 784857790084 = 1231163^2 + 885922^2 .
It is a cyclic number.
It is not a de Polignac number, because 2300620122653 - 24 = 2300620122637 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2300620122613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1150310061326 + 1150310061327.
It is an arithmetic number, because the mean of its divisors is an integer number (1150310061327).
Almost surely, 22300620122653 is an apocalyptic number.
It is an amenable number.
2300620122653 is a deficient number, since it is larger than the sum of its proper divisors (1).
2300620122653 is an equidigital number, since it uses as much as digits as its factorization.
2300620122653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 2300620122653 its reverse (3562210260032), we get a palindrome (5862830382685).
The spelling of 2300620122653 in words is "two trillion, three hundred billion, six hundred twenty million, one hundred twenty-two thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •