Base | Representation |
---|---|
bin | 110100010011001110110101… |
… | …001011011110010110110110 |
3 | 1010011102200212012201210112010 |
4 | 310103032311023132112312 |
5 | 220122121441341040202 |
6 | 2133113422453305050 |
7 | 66310253233415013 |
oct | 6423166513362666 |
9 | 1104380765653463 |
10 | 230020013221302 |
11 | 67322a37943817 |
12 | 2196b505035186 |
13 | 9b46a42a548c5 |
14 | 40b3056d3870a |
15 | 1b8d535d4676c |
hex | d133b52de5b6 |
230020013221302 has 16 divisors (see below), whose sum is σ = 475903475630640. Its totient is φ = 74029429542432.
The previous prime is 230020013221301. The next prime is 230020013221303. The reversal of 230020013221302 is 203122310020032.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (230020013221301) and next prime (230020013221303).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230020013221301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 660977049313 + ... + 660977049660.
It is an arithmetic number, because the mean of its divisors is an integer number (29743967226915).
Almost surely, 2230020013221302 is an apocalyptic number.
230020013221302 is an abundant number, since it is smaller than the sum of its proper divisors (245883462409338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230020013221302 is a wasteful number, since it uses less digits than its factorization.
230020013221302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1321954099007.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 230020013221302 its reverse (203122310020032), we get a palindrome (433142323241334).
The spelling of 230020013221302 in words is "two hundred thirty trillion, twenty billion, thirteen million, two hundred twenty-one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •