Base | Representation |
---|---|
bin | 1101011000110111011… |
… | …0110001000110001111 |
3 | 210222201000102202222200 |
4 | 3112031312301012033 |
5 | 12232031340223043 |
6 | 253355553212543 |
7 | 22421641014651 |
oct | 3261566610617 |
9 | 728630382880 |
10 | 230013211023 |
11 | 89603508932 |
12 | 386b2b61153 |
13 | 188c835b53b |
14 | b1c01a86d1 |
15 | 5eb330c7d3 |
hex | 358ddb118f |
230013211023 has 12 divisors (see below), whose sum is σ = 333534075888. Its totient is φ = 152745477120.
The previous prime is 230013211003. The next prime is 230013211097. The reversal of 230013211023 is 320112310032.
It is not a de Polignac number, because 230013211023 - 213 = 230013202831 is a prime.
It is a super-2 number, since 2×2300132110232 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 230013210987 and 230013211005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230013211003) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 49719523 + ... + 49724148.
It is an arithmetic number, because the mean of its divisors is an integer number (27794506324).
Almost surely, 2230013211023 is an apocalyptic number.
230013211023 is a deficient number, since it is larger than the sum of its proper divisors (103520864865).
230013211023 is a wasteful number, since it uses less digits than its factorization.
230013211023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99443934 (or 99443931 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 230013211023 its reverse (320112310032), we get a palindrome (550125521055).
Subtracting 230013211023 from its reverse (320112310032), we obtain a palindrome (90099099009).
The spelling of 230013211023 in words is "two hundred thirty billion, thirteen million, two hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •