Base | Representation |
---|---|
bin | 11101111111000101010… |
… | …10101001001010101111 |
3 | 10122111101101020120122022 |
4 | 32333202222221022233 |
5 | 113340023300410411 |
6 | 2105151400540355 |
7 | 134302536421016 |
oct | 16774252511257 |
9 | 3574341216568 |
10 | 1030300013231 |
11 | 367a47552345 |
12 | 1478194816bb |
13 | 76206864758 |
14 | 37c1c669a7d |
15 | 1bc018a2edb |
hex | efe2aa92af |
1030300013231 has 4 divisors (see below), whose sum is σ = 1030601891832. Its totient is φ = 1029998134632.
The previous prime is 1030300013213. The next prime is 1030300013263. The reversal of 1030300013231 is 1323100030301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1030300013231 is a prime.
It is a super-3 number, since 3×10303000132313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030300013531) 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, 150934181 + ... + 150941006.
It is an arithmetic number, because the mean of its divisors is an integer number (257650472958).
Almost surely, 21030300013231 is an apocalyptic number.
1030300013231 is a deficient number, since it is larger than the sum of its proper divisors (301878601).
1030300013231 is an equidigital number, since it uses as much as digits as its factorization.
1030300013231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 301878600.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 1030300013231 its reverse (1323100030301), we get a palindrome (2353400043532).
The spelling of 1030300013231 in words is "one trillion, thirty billion, three hundred million, thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •