Base | Representation |
---|---|
bin | 110100010110001001000101… |
… | …011000101100110010100101 |
3 | 1010012010211001201012210212000 |
4 | 310112021011120230302211 |
5 | 220133411030240244023 |
6 | 2133345335231515513 |
7 | 66330563146360515 |
oct | 6426110530546245 |
9 | 1105124051183760 |
10 | 230220001103013 |
11 | 6739a8328882a9 |
12 | 219a2218688b99 |
13 | 9b5c8646bcc9c |
14 | 40bc9c9583845 |
15 | 1b9383d1c5243 |
hex | d1624562cca5 |
230220001103013 has 32 divisors (see below), whose sum is σ = 346558040801280. Its totient is φ = 151017478320240.
The previous prime is 230220001102997. The next prime is 230220001103069. The reversal of 230220001103013 is 310301100022032.
230220001103013 is a `hidden beast` number, since 2 + 30 + 220 + 0 + 0 + 110 + 301 + 3 = 666.
It is not a de Polignac number, because 230220001103013 - 24 = 230220001102997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230220001103093) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 118413381 + ... + 120341882.
It is an arithmetic number, because the mean of its divisors is an integer number (10829938775040).
Almost surely, 2230220001103013 is an apocalyptic number.
It is an amenable number.
230220001103013 is a deficient number, since it is larger than the sum of its proper divisors (116338039698267).
230220001103013 is a wasteful number, since it uses less digits than its factorization.
230220001103013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238755846 (or 238755840 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 230220001103013 its reverse (310301100022032), we get a palindrome (540521101125045).
The spelling of 230220001103013 in words is "two hundred thirty trillion, two hundred twenty billion, one million, one hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •