Base | Representation |
---|---|
bin | 110100010110001011001000… |
… | …100001011010101000000001 |
3 | 1010012011000202001002110221011 |
4 | 310112023020201122220001 |
5 | 220133430032002000301 |
6 | 2133350341423400521 |
7 | 66331001523045004 |
oct | 6426131041325001 |
9 | 1105130661073834 |
10 | 230222201203201 |
11 | 673a0761776119 |
12 | 219a2731453141 |
13 | 9b5cb2545810c |
14 | 40bcb5784953b |
15 | 1b9391b411a51 |
hex | d162c885aa01 |
230222201203201 has 4 divisors (see below), whose sum is σ = 230222344898304. Its totient is φ = 230222057508100.
The previous prime is 230222201203199. The next prime is 230222201203243. The reversal of 230222201203201 is 102302102222032.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 230222201203201 - 21 = 230222201203199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230222201203271) 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, 69416905 + ... + 72657766.
It is an arithmetic number, because the mean of its divisors is an integer number (57555586224576).
Almost surely, 2230222201203201 is an apocalyptic number.
It is an amenable number.
230222201203201 is a deficient number, since it is larger than the sum of its proper divisors (143695103).
230222201203201 is a wasteful number, since it uses less digits than its factorization.
230222201203201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143695102.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 230222201203201 its reverse (102302102222032), we get a palindrome (332524303425233).
The spelling of 230222201203201 in words is "two hundred thirty trillion, two hundred twenty-two billion, two hundred one million, two hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •