Base | Representation |
---|---|
bin | 1000100101001001… |
… | …1100000011100101 |
3 | 12221112002101012121 |
4 | 2021102130003211 |
5 | 14204121441401 |
6 | 1020315545541 |
7 | 111035554426 |
oct | 21122340345 |
9 | 5845071177 |
10 | 2303312101 |
11 | a82183522 |
12 | 54345b2b1 |
13 | 2a926488c |
14 | 17bc9164d |
15 | d7327ca1 |
hex | 8949c0e5 |
2303312101 has 2 divisors, whose sum is σ = 2303312102. Its totient is φ = 2303312100.
The previous prime is 2303312057. The next prime is 2303312111. The reversal of 2303312101 is 1012133032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2230295076 + 73017025 = 47226^2 + 8545^2 .
It is a cyclic number.
It is not a de Polignac number, because 2303312101 - 229 = 1766441189 is a prime.
It is a super-2 number, since 2×23033121012 = 10610493269226068402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2303312111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1151656050 + 1151656051.
It is an arithmetic number, because the mean of its divisors is an integer number (1151656051).
Almost surely, 22303312101 is an apocalyptic number.
It is an amenable number.
2303312101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2303312101 is an equidigital number, since it uses as much as digits as its factorization.
2303312101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 2303312101 is about 47992.8338504823. The cubic root of 2303312101 is about 1320.6394401513.
Adding to 2303312101 its reverse (1012133032), we get a palindrome (3315445133).
The spelling of 2303312101 in words is "two billion, three hundred three million, three hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •