Base | Representation |
---|---|
bin | 1000010011101110… |
… | …1010000100011011 |
3 | 12202102120111020010 |
4 | 2010323222010123 |
5 | 14031414400243 |
6 | 1005145333003 |
7 | 106160440065 |
oct | 20473520433 |
9 | 5672514203 |
10 | 2230231323 |
11 | a449a8891 |
12 | 522a97163 |
13 | 297087a08 |
14 | 1722aa735 |
15 | d0bde433 |
hex | 84eea11b |
2230231323 has 8 divisors (see below), whose sum is σ = 2983791888. Its totient is φ = 1481745824.
The previous prime is 2230231319. The next prime is 2230231327. The reversal of 2230231323 is 3231320322.
It is an interprime number because it is at equal distance from previous prime (2230231319) and next prime (2230231327).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2230231323 - 22 = 2230231319 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2230231323.
It is not an unprimeable number, because it can be changed into a prime (2230231327) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1267740 + ... + 1269497.
It is an arithmetic number, because the mean of its divisors is an integer number (372973986).
Almost surely, 22230231323 is an apocalyptic number.
2230231323 is a deficient number, since it is larger than the sum of its proper divisors (753560565).
2230231323 is a wasteful number, since it uses less digits than its factorization.
2230231323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2537533.
The product of its (nonzero) digits is 1296, while the sum is 21.
The square root of 2230231323 is about 47225.3250174099. The cubic root of 2230231323 is about 1306.5217292109.
Adding to 2230231323 its reverse (3231320322), we get a palindrome (5461551645).
The spelling of 2230231323 in words is "two billion, two hundred thirty million, two hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •