Base | Representation |
---|---|
bin | 1101011001100100011… |
… | …1000011100010000101 |
3 | 211000012011201210020000 |
4 | 3112121013003202011 |
5 | 12232423204431323 |
6 | 253430420231513 |
7 | 22426422654141 |
oct | 3263107034205 |
9 | 730164653200 |
10 | 230202030213 |
11 | 896a0054551 |
12 | 3874623b599 |
13 | 189284cc67c |
14 | b1db2ba221 |
15 | 5ec4ba8e43 |
hex | 35991c3885 |
230202030213 has 20 divisors (see below), whose sum is σ = 361981102560. Its totient is φ = 145390754952.
The previous prime is 230202030161. The next prime is 230202030217. The reversal of 230202030213 is 312030202032.
It is a happy number.
230202030213 is a `hidden beast` number, since 230 + 20 + 203 + 0 + 213 = 666.
It is not a de Polignac number, because 230202030213 - 217 = 230201899141 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230202030217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 74787945 + ... + 74791022.
It is an arithmetic number, because the mean of its divisors is an integer number (18099055128).
Almost surely, 2230202030213 is an apocalyptic number.
It is an amenable number.
230202030213 is a deficient number, since it is larger than the sum of its proper divisors (131779072347).
230202030213 is a wasteful number, since it uses less digits than its factorization.
230202030213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149578998 (or 149578989 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 230202030213 its reverse (312030202032), we get a palindrome (542232232245).
The spelling of 230202030213 in words is "two hundred thirty billion, two hundred two million, thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •