Base | Representation |
---|---|
bin | 100010011101100011111010… |
… | …0101000100011011000110001 |
3 | 1110202021221112200002010100101 |
4 | 1010323013310220203120301 |
5 | 304212440230321334301 |
6 | 2552412001001152401 |
7 | 120564264155150635 |
oct | 10473076450433061 |
9 | 1422257480063311 |
10 | 303130011121201 |
11 | 8864a796770900 |
12 | 29bb876348b701 |
13 | 1001b064201524 |
14 | 54bd7dc490dc5 |
15 | 250a191db1701 |
hex | 113b1f4a23631 |
303130011121201 has 24 divisors (see below), whose sum is σ = 334414358788832. Its totient is φ = 274562429803200.
The previous prime is 303130011121121. The next prime is 303130011121237. The reversal of 303130011121201 is 102121110031303.
It is not a de Polignac number, because 303130011121201 - 219 = 303130010596913 is a prime.
It is a super-2 number, since 2×3031300111212012 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (303130011121291) 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 23 ways as a sum of consecutive naturals, for example, 258325930 + ... + 259496716.
Almost surely, 2303130011121201 is an apocalyptic number.
It is an amenable number.
303130011121201 is a deficient number, since it is larger than the sum of its proper divisors (31284347667631).
303130011121201 is a wasteful number, since it uses less digits than its factorization.
303130011121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1178653 (or 1178642 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 303130011121201 its reverse (102121110031303), we get a palindrome (405251121152504).
The spelling of 303130011121201 in words is "three hundred three trillion, one hundred thirty billion, eleven million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •