Base | Representation |
---|---|
bin | 11101001100011100001… |
… | …01001101101000101101 |
3 | 10112220012112112020202021 |
4 | 32212032011031220231 |
5 | 112413332421024323 |
6 | 2044453424230141 |
7 | 132321012522061 |
oct | 16461605155055 |
9 | 3486175466667 |
10 | 1003111111213 |
11 | 357465086892 |
12 | 1424aba6b351 |
13 | 737929b4153 |
14 | 3679d6d3aa1 |
15 | 1b15e95705d |
hex | e98e14da2d |
1003111111213 has 8 divisors (see below), whose sum is σ = 1011322044000. Its totient is φ = 994919893968.
The previous prime is 1003111111199. The next prime is 1003111111229. The reversal of 1003111111213 is 3121111113001.
1003111111213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1003111111213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1003111111253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4826703 + ... + 5030236.
It is an arithmetic number, because the mean of its divisors is an integer number (126415255500).
Almost surely, 21003111111213 is an apocalyptic number.
It is an amenable number.
1003111111213 is a deficient number, since it is larger than the sum of its proper divisors (8210932787).
1003111111213 is an equidigital number, since it uses as much as digits as its factorization.
1003111111213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9857771.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 1003111111213 its reverse (3121111113001), we get a palindrome (4124222224214).
The spelling of 1003111111213 in words is "one trillion, three billion, one hundred eleven million, one hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •