Base | Representation |
---|---|
bin | 100010010110111000111111… |
… | …0011100011100011000001110 |
3 | 1110122001022002112120211020110 |
4 | 1010231301332130130120032 |
5 | 304102430113222414410 |
6 | 2550430454425300450 |
7 | 120441116555002623 |
oct | 10455617634343016 |
9 | 1418038075524213 |
10 | 302213200201230 |
11 | 8832699791701a |
12 | 29a8ab39334726 |
13 | cc82775984ac6 |
14 | 548b2a856834a |
15 | 24e13d3aab720 |
hex | 112dc7e71c60e |
302213200201230 has 32 divisors (see below), whose sum is σ = 725901844672800. Its totient is φ = 80524612921472.
The previous prime is 302213200201193. The next prime is 302213200201273. The reversal of 302213200201230 is 32102002312203.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 302213200201197 and 302213200201206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4098324945 + ... + 4098398684.
It is an arithmetic number, because the mean of its divisors is an integer number (22684432646025).
Almost surely, 2302213200201230 is an apocalyptic number.
302213200201230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
302213200201230 is an abundant number, since it is smaller than the sum of its proper divisors (423688644471570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
302213200201230 is a wasteful number, since it uses less digits than its factorization.
302213200201230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8196724868.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 302213200201230 its reverse (32102002312203), we get a palindrome (334315202513433).
The spelling of 302213200201230 in words is "three hundred two trillion, two hundred thirteen billion, two hundred million, two hundred one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •