Base | Representation |
---|---|
bin | 11101111110111101000… |
… | …11011010111011010111 |
3 | 10122111012120101220102021 |
4 | 32333132203122323113 |
5 | 113334403114323111 |
6 | 2105140453554011 |
7 | 134301041051305 |
oct | 16773643327327 |
9 | 3574176356367 |
10 | 1030231011031 |
11 | 367a11602a32 |
12 | 1477ba345907 |
13 | 761c5485151 |
14 | 37c13427275 |
15 | 1bbea7c2d71 |
hex | efde8daed7 |
1030231011031 has 4 divisors (see below), whose sum is σ = 1030233067864. Its totient is φ = 1030228954200.
The previous prime is 1030231011011. The next prime is 1030231011037. The reversal of 1030231011031 is 1301101320301.
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 1030231011031 - 29 = 1030231010519 is a prime.
It is a super-2 number, since 2×10302310110312 (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 = 1030231010996 and 1030231011014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030231011037) 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, 265876 + ... + 1459846.
It is an arithmetic number, because the mean of its divisors is an integer number (257558266966).
Almost surely, 21030231011031 is an apocalyptic number.
1030231011031 is a deficient number, since it is larger than the sum of its proper divisors (2056833).
1030231011031 is an equidigital number, since it uses as much as digits as its factorization.
1030231011031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2056832.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1030231011031 its reverse (1301101320301), we get a palindrome (2331332331332).
The spelling of 1030231011031 in words is "one trillion, thirty billion, two hundred thirty-one million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •