Base | Representation |
---|---|
bin | 1000101011100100… |
… | …0001000001110110 |
3 | 20000101200112112022 |
4 | 2022321001001312 |
5 | 14233012432410 |
6 | 1023120153142 |
7 | 111513251336 |
oct | 21271010166 |
9 | 6011615468 |
10 | 2330202230 |
11 | a9637a474 |
12 | 5504687b2 |
13 | 2b19bb1b5 |
14 | 1816910c6 |
15 | d988a455 |
hex | 8ae41076 |
2330202230 has 8 divisors (see below), whose sum is σ = 4194364032. Its totient is φ = 932080888.
The previous prime is 2330202211. The next prime is 2330202239. The reversal of 2330202230 is 322020332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×23302022303 (a number of 29 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2330202199 and 2330202208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2330202239) 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 in 3 ways as a sum of consecutive naturals, for example, 116510102 + ... + 116510121.
It is an arithmetic number, because the mean of its divisors is an integer number (524295504).
Almost surely, 22330202230 is an apocalyptic number.
2330202230 is a deficient number, since it is larger than the sum of its proper divisors (1864161802).
2330202230 is a wasteful number, since it uses less digits than its factorization.
2330202230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233020230.
The product of its (nonzero) digits is 432, while the sum is 17.
The square root of 2330202230 is about 48272.1682753116. The cubic root of 2330202230 is about 1325.7588589993.
Adding to 2330202230 its reverse (322020332), we get a palindrome (2652222562).
The spelling of 2330202230 in words is "two billion, three hundred thirty million, two hundred two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •