Base | Representation |
---|---|
bin | 11101001100110100010… |
… | …11001111111100001111 |
3 | 10112220201200100002102122 |
4 | 32212122023033330033 |
5 | 112414241342120421 |
6 | 2044525513243155 |
7 | 132326025313154 |
oct | 16463213177417 |
9 | 3486650302378 |
10 | 1003314020111 |
11 | 357559676297 |
12 | 142547a034bb |
13 | 737c5a494a0 |
14 | 367bc63222b |
15 | 1b1726882ab |
hex | e99a2cff0f |
1003314020111 has 8 divisors (see below), whose sum is σ = 1080503249280. Its totient is φ = 926126394912.
The previous prime is 1003314020089. The next prime is 1003314020171. The reversal of 1003314020111 is 1110204133001.
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 1003314020111 - 26 = 1003314020047 is a prime.
It is a super-2 number, since 2×10033140201112 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1003314020111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1003314020171) 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, 1108706 + ... + 1798848.
It is an arithmetic number, because the mean of its divisors is an integer number (135062906160).
Almost surely, 21003314020111 is an apocalyptic number.
1003314020111 is a deficient number, since it is larger than the sum of its proper divisors (77189229169).
1003314020111 is a wasteful number, since it uses less digits than its factorization.
1003314020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 801985.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1003314020111 its reverse (1110204133001), we get a palindrome (2113518153112).
The spelling of 1003314020111 in words is "one trillion, three billion, three hundred fourteen million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •