Base | Representation |
---|---|
bin | 1101011001001100001… |
… | …0101011100100111111 |
3 | 210222221002011022011122 |
4 | 3112103002223210333 |
5 | 12232221124021343 |
6 | 253412342141155 |
7 | 22424045413046 |
oct | 3262302534477 |
9 | 728832138148 |
10 | 230100220223 |
11 | 89648637165 |
12 | 387181217bb |
13 | 189103a4083 |
14 | b1cb97755d |
15 | 5ebac98068 |
hex | 35930ab93f |
230100220223 has 4 divisors (see below), whose sum is σ = 240104577648. Its totient is φ = 220095862800.
The previous prime is 230100220201. The next prime is 230100220267. The reversal of 230100220223 is 322022001032.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 230100220223 - 26 = 230100220159 is a prime.
It is a super-2 number, since 2×2301002202232 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230103220223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5002178678 + ... + 5002178723.
It is an arithmetic number, because the mean of its divisors is an integer number (60026144412).
Almost surely, 2230100220223 is an apocalyptic number.
230100220223 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
230100220223 is a deficient number, since it is larger than the sum of its proper divisors (10004357425).
230100220223 is a wasteful number, since it uses less digits than its factorization.
230100220223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10004357424.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 230100220223 its reverse (322022001032), we get a palindrome (552122221255).
The spelling of 230100220223 in words is "two hundred thirty billion, one hundred million, two hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •