Base | Representation |
---|---|
bin | 11101001100011100010… |
… | …01110011100010000011 |
3 | 10112220012121210102001101 |
4 | 32212032021303202003 |
5 | 112413333223040021 |
6 | 2044453510115231 |
7 | 132321025664512 |
oct | 16461611634203 |
9 | 3486177712041 |
10 | 1003112315011 |
11 | 357465829264 |
12 | 1424b034bb17 |
13 | 73793016061 |
14 | 3679d928679 |
15 | 1b15eae3a91 |
hex | e98e273883 |
1003112315011 has 8 divisors (see below), whose sum is σ = 1029310377984. Its totient is φ = 977116554120.
The previous prime is 1003112314993. The next prime is 1003112315071. The reversal of 1003112315011 is 1105132113001.
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 1003112315011 - 25 = 1003112314979 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1003112315011.
It is not an unprimeable number, because it can be changed into a prime (1003112315071) 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, 50565475 + ... + 50585308.
It is an arithmetic number, because the mean of its divisors is an integer number (128663797248).
Almost surely, 21003112315011 is an apocalyptic number.
1003112315011 is a deficient number, since it is larger than the sum of its proper divisors (26198062973).
1003112315011 is a wasteful number, since it uses less digits than its factorization.
1003112315011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101151041.
The product of its (nonzero) digits is 90, while the sum is 19.
Adding to 1003112315011 its reverse (1105132113001), we get a palindrome (2108244428012).
The spelling of 1003112315011 in words is "one trillion, three billion, one hundred twelve million, three hundred fifteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •