Base | Representation |
---|---|
bin | 100010001110010010100101… |
… | …1000011111000111010110000 |
3 | 1110110212022012110022001100010 |
4 | 1010130211023003320322300 |
5 | 303424043420330320422 |
6 | 2544123500113054520 |
7 | 120256534212042261 |
oct | 10434451303707260 |
9 | 1413768173261303 |
10 | 301031222120112 |
11 | 87a10696023370 |
12 | 29919a4b257440 |
13 | cbc8179003333 |
14 | 5449dbb734968 |
15 | 24c07a6158b0c |
hex | 111c94b0f8eb0 |
301031222120112 has 80 divisors (see below), whose sum is σ = 848689670206080. Its totient is φ = 91186211136000.
The previous prime is 301031222120107. The next prime is 301031222120149. The reversal of 301031222120112 is 211021222130103.
It is a super-2 number, since 2×3010312221201122 (a number of 30 digits) contains 22 as substring.
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, 109172389 + ... + 111895812.
It is an arithmetic number, because the mean of its divisors is an integer number (10608620877576).
Almost surely, 2301031222120112 is an apocalyptic number.
It is an amenable number.
301031222120112 is an abundant number, since it is smaller than the sum of its proper divisors (547658448085968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
301031222120112 is a wasteful number, since it uses less digits than its factorization.
301031222120112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 221070802 (or 221070796 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 301031222120112 its reverse (211021222130103), we get a palindrome (512052444250215).
Subtracting from 301031222120112 its reverse (211021222130103), we obtain a palindrome (90009999990009).
The spelling of 301031222120112 in words is "three hundred one trillion, thirty-one billion, two hundred twenty-two million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •