Base | Representation |
---|---|
bin | 111101011101110… |
… | …000100000000101 |
3 | 2122212101221120111 |
4 | 331131300200011 |
5 | 4102442223023 |
6 | 250154233021 |
7 | 34361102050 |
oct | 7535604005 |
9 | 2585357514 |
10 | 1031211013 |
11 | 48a101108 |
12 | 249425771 |
13 | 135847441 |
14 | 9ad53a97 |
15 | 607e900d |
hex | 3d770805 |
1031211013 has 4 divisors (see below), whose sum is σ = 1178526880. Its totient is φ = 883895148.
The previous prime is 1031210981. The next prime is 1031211017. The reversal of 1031211013 is 3101121301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1031211013 - 25 = 1031210981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1031210984 and 1031211002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1031211017) 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, 73657923 + ... + 73657936.
It is an arithmetic number, because the mean of its divisors is an integer number (294631720).
Almost surely, 21031211013 is an apocalyptic number.
It is an amenable number.
1031211013 is a deficient number, since it is larger than the sum of its proper divisors (147315867).
1031211013 is an equidigital number, since it uses as much as digits as its factorization.
1031211013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147315866.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1031211013 is about 32112.4744141587. The cubic root of 1031211013 is about 1010.2972732113.
Adding to 1031211013 its reverse (3101121301), we get a palindrome (4132332314).
The spelling of 1031211013 in words is "one billion, thirty-one million, two hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •