Base | Representation |
---|---|
bin | 100010001110001101111000… |
… | …0011101010101101100010001 |
3 | 1110110211100002212120100120210 |
4 | 1010130123300131111230101 |
5 | 303423412214201132241 |
6 | 2544115105000554333 |
7 | 120256025530410342 |
oct | 10434336035255421 |
9 | 1413740085510523 |
10 | 301021112130321 |
11 | 87a07378214400 |
12 | 29917aa94829a9 |
13 | cbc72275b535b |
14 | 54496dcb400c9 |
15 | 24c03b37c1316 |
hex | 111c6f0755b11 |
301021112130321 has 48 divisors (see below), whose sum is σ = 442812414243584. Its totient is φ = 181756216224000.
The previous prime is 301021112130283. The next prime is 301021112130377. The reversal of 301021112130321 is 123031211120103.
It is not a de Polignac number, because 301021112130321 - 211 = 301021112128273 is a prime.
It is a super-2 number, since 2×3010211121303212 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (301021112130421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3114145731 + ... + 3114242391.
Almost surely, 2301021112130321 is an apocalyptic number.
It is an amenable number.
301021112130321 is a deficient number, since it is larger than the sum of its proper divisors (141791302113263).
301021112130321 is a wasteful number, since it uses less digits than its factorization.
301021112130321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128614 (or 128603 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 301021112130321 its reverse (123031211120103), we get a palindrome (424052323250424).
The spelling of 301021112130321 in words is "three hundred one trillion, twenty-one billion, one hundred twelve million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •