Base | Representation |
---|---|
bin | 1101011001100110101… |
… | …0100001111111100111 |
3 | 211000012211020021011102 |
4 | 3112121222201333213 |
5 | 12232433100030043 |
6 | 253431351430315 |
7 | 22426565006243 |
oct | 3263152417747 |
9 | 730184207142 |
10 | 230211330023 |
11 | 896a5326644 |
12 | 3874938539b |
13 | 1892a40760c |
14 | b1dc61b423 |
15 | 5ec58e46b8 |
hex | 3599aa1fe7 |
230211330023 has 8 divisors (see below), whose sum is σ = 235632329856. Its totient is φ = 224793387000.
The previous prime is 230211330001. The next prime is 230211330073. The reversal of 230211330023 is 320033112032.
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 230211330023 - 28 = 230211329767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230211329977 and 230211330004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230211330073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 611453 + ... + 913398.
It is an arithmetic number, because the mean of its divisors is an integer number (29454041232).
Almost surely, 2230211330023 is an apocalyptic number.
230211330023 is a deficient number, since it is larger than the sum of its proper divisors (5420999833).
230211330023 is a wasteful number, since it uses less digits than its factorization.
230211330023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1528405.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 230211330023 its reverse (320033112032), we get a palindrome (550244442055).
The spelling of 230211330023 in words is "two hundred thirty billion, two hundred eleven million, three hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •