Base | Representation |
---|---|
bin | 1000101011100101… |
… | …1001011100000101 |
3 | 20000101212121200101 |
4 | 2022321121130011 |
5 | 14233024132323 |
6 | 1023122244101 |
7 | 111514146001 |
oct | 21271313405 |
9 | 6011777611 |
10 | 2330302213 |
11 | a964385a8 |
12 | 5504b6631 |
13 | 2b1a24865 |
14 | 1816b9701 |
15 | d98a9dad |
hex | 8ae59705 |
2330302213 has 2 divisors, whose sum is σ = 2330302214. Its totient is φ = 2330302212.
The previous prime is 2330302189. The next prime is 2330302223. The reversal of 2330302213 is 3122030332.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2245053924 + 85248289 = 47382^2 + 9233^2 .
It is a cyclic number.
It is not a de Polignac number, because 2330302213 - 225 = 2296747781 is a prime.
It is a super-3 number, since 3×23303022133 (a number of 29 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2330302223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1165151106 + 1165151107.
It is an arithmetic number, because the mean of its divisors is an integer number (1165151107).
Almost surely, 22330302213 is an apocalyptic number.
It is an amenable number.
2330302213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2330302213 is an equidigital number, since it uses as much as digits as its factorization.
2330302213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 19.
The square root of 2330302213 is about 48273.2038816567. The cubic root of 2330302213 is about 1325.7778203653. Note that the first 3 decimals are identical.
Adding to 2330302213 its reverse (3122030332), we get a palindrome (5452332545).
The spelling of 2330302213 in words is "two billion, three hundred thirty million, three hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •