Base | Representation |
---|---|
bin | 11101111111000101010… |
… | …10101101010001001111 |
3 | 10122111101101021102200112 |
4 | 32333202222231101033 |
5 | 113340023301430111 |
6 | 2105151401150235 |
7 | 134302536521006 |
oct | 16774252552117 |
9 | 3574341242615 |
10 | 1030300030031 |
11 | 367a47563a28 |
12 | 14781948b37b |
13 | 7620686c2ac |
14 | 37c1c671c3d |
15 | 1bc018a7e8b |
hex | efe2aad44f |
1030300030031 has 4 divisors (see below), whose sum is σ = 1030754109000. Its totient is φ = 1029845951064.
The previous prime is 1030300029991. The next prime is 1030300030033. The reversal of 1030300030031 is 1300300030301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1030300030031 - 210 = 1030300029007 is a prime.
It is a super-2 number, since 2×10303000300312 (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 = 1030300029988 and 1030300030015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030300030033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 227036081 + ... + 227040618.
It is an arithmetic number, because the mean of its divisors is an integer number (257688527250).
Almost surely, 21030300030031 is an apocalyptic number.
1030300030031 is a deficient number, since it is larger than the sum of its proper divisors (454078969).
1030300030031 is an equidigital number, since it uses as much as digits as its factorization.
1030300030031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 454078968.
The product of its (nonzero) digits is 81, while the sum is 14.
Adding to 1030300030031 its reverse (1300300030301), we get a palindrome (2330600060332).
The spelling of 1030300030031 in words is "one trillion, thirty billion, three hundred million, thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •