Base | Representation |
---|---|
bin | 11101111111000101100… |
… | …11010111011101111111 |
3 | 10122111101112112202112121 |
4 | 32333202303113131333 |
5 | 113340024342100111 |
6 | 2105151521543411 |
7 | 134302565024044 |
oct | 16774263273577 |
9 | 3574345482477 |
10 | 1030302300031 |
11 | 367a48874464 |
12 | 14781a1a4b67 |
13 | 762071855a4 |
14 | 37c1caa31cb |
15 | 1bc01ba5871 |
hex | efe2cd777f |
1030302300031 has 6 divisors (see below), whose sum is σ = 1056044536496. Its totient is φ = 1005172974000.
The previous prime is 1030302300029. The next prime is 1030302300037. The reversal of 1030302300031 is 1300032030301.
It is not a de Polignac number, because 1030302300031 - 21 = 1030302300029 is a prime.
It is a super-2 number, since 2×10303023000312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030302299978 and 1030302300014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030302300037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 306453495 + ... + 306456856.
Almost surely, 21030302300031 is an apocalyptic number.
1030302300031 is a deficient number, since it is larger than the sum of its proper divisors (25742236465).
1030302300031 is an frugal number, since it uses more digits than its factorization.
1030302300031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 612910433 (or 612910392 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 1030302300031 its reverse (1300032030301), we get a palindrome (2330334330332).
The spelling of 1030302300031 in words is "one trillion, thirty billion, three hundred two million, three hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •