Base | Representation |
---|---|
bin | 100010011110010010011110… |
… | …1101001010101110000110000 |
3 | 1110202122111200111000102011012 |
4 | 1010330210331221111300300 |
5 | 304221110040144441422 |
6 | 2552525540453210052 |
7 | 120604434403226045 |
oct | 10474447551256060 |
9 | 1422574614012135 |
10 | 303230020312112 |
11 | 886891473041a3 |
12 | 2a014014330928 |
13 | 100276118ab47a |
14 | 54c45a88251cc |
15 | 250ca96d144e2 |
hex | 113c93da55c30 |
303230020312112 has 20 divisors (see below), whose sum is σ = 588268200813840. Its totient is φ = 151418871715008.
The previous prime is 303230020312067. The next prime is 303230020312117. The reversal of 303230020312112 is 211213020032303.
It is a super-2 number, since 2×3032300203121122 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (303230020312117) 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 3 ways as a sum of consecutive naturals, for example, 12258639812 + ... + 12258664547.
It is an arithmetic number, because the mean of its divisors is an integer number (29413410040692).
Almost surely, 2303230020312112 is an apocalyptic number.
It is an amenable number.
303230020312112 is a deficient number, since it is larger than the sum of its proper divisors (285038180501728).
303230020312112 is a wasteful number, since it uses less digits than its factorization.
303230020312112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24517305140 (or 24517305134 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 303230020312112 its reverse (211213020032303), we get a palindrome (514443040344415).
The spelling of 303230020312112 in words is "three hundred three trillion, two hundred thirty billion, twenty million, three hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •