Base | Representation |
---|---|
bin | 1001010111100010100110… |
… | …1001100010010100010011 |
3 | 1100110200011211020012200200 |
4 | 2111320221221202110103 |
5 | 2322223430231031011 |
6 | 33523434004150243 |
7 | 2112103232151663 |
oct | 225705151422423 |
9 | 40420154205620 |
10 | 10300030330131 |
11 | 3311244666843 |
12 | 11a426b398383 |
13 | 59939a346449 |
14 | 27874a2c81a3 |
15 | 12cdda0e3856 |
hex | 95e29a62513 |
10300030330131 has 6 divisors (see below), whose sum is σ = 14877821587980. Its totient is φ = 6866686886748.
The previous prime is 10300030330123. The next prime is 10300030330133. The reversal of 10300030330131 is 13103303000301.
10300030330131 is a `hidden beast` number, since 1 + 0 + 30 + 0 + 0 + 303 + 301 + 31 = 666.
It is not a de Polignac number, because 10300030330131 - 23 = 10300030330123 is a prime.
It is a super-2 number, since 2×103000303301312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10300030330133) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 572223907221 + ... + 572223907238.
It is an arithmetic number, because the mean of its divisors is an integer number (2479636931330).
Almost surely, 210300030330131 is an apocalyptic number.
10300030330131 is a deficient number, since it is larger than the sum of its proper divisors (4577791257849).
10300030330131 is a wasteful number, since it uses less digits than its factorization.
10300030330131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1144447814465 (or 1144447814462 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 18.
Adding to 10300030330131 its reverse (13103303000301), we get a palindrome (23403333330432).
The spelling of 10300030330131 in words is "ten trillion, three hundred billion, thirty million, three hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •