Base | Representation |
---|---|
bin | 10010111100110001010… |
… | …010110101000100010110 |
3 | 11121111012201000020120022 |
4 | 102330301102311010112 |
5 | 132313402220011410 |
6 | 2434120130305142 |
7 | 163036532210000 |
oct | 22746122650426 |
9 | 4544181006508 |
10 | 1302202110230 |
11 | 4622961631aa |
12 | 190460a281b2 |
13 | 95a493b7448 |
14 | 47053c15370 |
15 | 23d1740c455 |
hex | 12f314b5116 |
1302202110230 has 80 divisors (see below), whose sum is σ = 2878381770480. Its totient is φ = 422970762816.
The previous prime is 1302202110229. The next prime is 1302202110263. The reversal of 1302202110230 is 320112022031.
It is a junction number, because it is equal to n+sod(n) for n = 1302202110199 and 1302202110208.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 971069 + ... + 1883448.
It is an arithmetic number, because the mean of its divisors is an integer number (35979772131).
Almost surely, 21302202110230 is an apocalyptic number.
1302202110230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1302202110230 is an abundant number, since it is smaller than the sum of its proper divisors (1576179660250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1302202110230 is an equidigital number, since it uses as much as digits as its factorization.
1302202110230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2854571 (or 2854550 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1302202110230 its reverse (320112022031), we get a palindrome (1622314132261).
The spelling of 1302202110230 in words is "one trillion, three hundred two billion, two hundred two million, one hundred ten thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •