Base | Representation |
---|---|
bin | 1101011000111101110… |
… | …1000010010011111111 |
3 | 210222202212212211022000 |
4 | 3112033131002103333 |
5 | 12232110221121343 |
6 | 253402351553343 |
7 | 22422414623616 |
oct | 3261735022377 |
9 | 728685784260 |
10 | 230040020223 |
11 | 89617659aa2 |
12 | 386bbb2b853 |
13 | 18900a87080 |
14 | b1c398687d |
15 | 5eb5855ed3 |
hex | 358f7424ff |
230040020223 has 32 divisors (see below), whose sum is σ = 367044142080. Its totient is φ = 141552010080.
The previous prime is 230040020137. The next prime is 230040020227. The reversal of 230040020223 is 322020040032.
230040020223 is a `hidden beast` number, since 23 + 0 + 0 + 400 + 20 + 223 = 666.
It is not a de Polignac number, because 230040020223 - 222 = 230035825919 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 230040020196 and 230040020205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230040020227) 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 31 ways as a sum of consecutive naturals, for example, 8446558 + ... + 8473748.
It is an arithmetic number, because the mean of its divisors is an integer number (11470129440).
Almost surely, 2230040020223 is an apocalyptic number.
230040020223 is a deficient number, since it is larger than the sum of its proper divisors (137004121857).
230040020223 is a wasteful number, since it uses less digits than its factorization.
230040020223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51316 (or 51310 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 18.
Adding to 230040020223 its reverse (322020040032), we get a palindrome (552060060255).
The spelling of 230040020223 in words is "two hundred thirty billion, forty million, twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •