Base | Representation |
---|---|
bin | 100010010101100100001010… |
… | …0011100001101110101010001 |
3 | 1110121101212220000002210120021 |
4 | 1010223020110130031311101 |
5 | 304041434023440132241 |
6 | 2550211050252543441 |
7 | 120422010363311545 |
oct | 10453102434156521 |
9 | 1417355800083507 |
10 | 302031033130321 |
11 | 882667072a6450 |
12 | 29a5b779a81b81 |
13 | cc6b53409b1a1 |
14 | 5482546a23a25 |
15 | 24db7c0edd0d1 |
hex | 112b21470dd51 |
302031033130321 has 16 divisors (see below), whose sum is σ = 340120807243776. Its totient is φ = 265713522210000.
The previous prime is 302031033130213. The next prime is 302031033130331. The reversal of 302031033130321 is 123031330130203.
It is a cyclic number.
It is not a de Polignac number, because 302031033130321 - 237 = 301893594176849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (302031033130331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26389456 + ... + 36061966.
It is an arithmetic number, because the mean of its divisors is an integer number (21257550452736).
Almost surely, 2302031033130321 is an apocalyptic number.
302031033130321 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
302031033130321 is a deficient number, since it is larger than the sum of its proper divisors (38089774113455).
302031033130321 is a wasteful number, since it uses less digits than its factorization.
302031033130321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9764124.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 302031033130321 its reverse (123031330130203), we get a palindrome (425062363260524).
The spelling of 302031033130321 in words is "three hundred two trillion, thirty-one billion, thirty-three million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •