Base | Representation |
---|---|
bin | 11101001100011011000… |
… | …10100100110010100011 |
3 | 10112220011220102221001111 |
4 | 32212031202210302203 |
5 | 112413323104443021 |
6 | 2044452501444151 |
7 | 132320542403143 |
oct | 16461542446243 |
9 | 3486156387044 |
10 | 1003102031011 |
11 | 35745aa44793 |
12 | 1424a8a10657 |
13 | 73790b55152 |
14 | 3679c40c923 |
15 | 1b15dc618e1 |
hex | e98d8a4ca3 |
1003102031011 has 8 divisors (see below), whose sum is σ = 1030248389360. Its totient is φ = 975957540768.
The previous prime is 1003102030969. The next prime is 1003102031083. The reversal of 1003102031011 is 1101302013001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1003102031011 - 211 = 1003102028963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1003102030982 and 1003102031000.
It is not an unprimeable number, because it can be changed into a prime (1003102038011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 657580 + ... + 1561606.
It is an arithmetic number, because the mean of its divisors is an integer number (128781048670).
Almost surely, 21003102031011 is an apocalyptic number.
1003102031011 is a deficient number, since it is larger than the sum of its proper divisors (27146358349).
1003102031011 is an equidigital number, since it uses as much as digits as its factorization.
1003102031011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 934053.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1003102031011 its reverse (1101302013001), we get a palindrome (2104404044012).
The spelling of 1003102031011 in words is "one trillion, three billion, one hundred two million, thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •