Base | Representation |
---|---|
bin | 111100011001011… |
… | …110011001111101 |
3 | 2121121201112111210 |
4 | 330121132121331 |
5 | 4033401423401 |
6 | 244314435033 |
7 | 34053000525 |
oct | 7431363175 |
9 | 2547645453 |
10 | 1013311101 |
11 | 47aa956a0 |
12 | 243432a79 |
13 | 131c1ab8a |
14 | 98814685 |
15 | 5de604d6 |
hex | 3c65e67d |
1013311101 has 8 divisors (see below), whose sum is σ = 1473907104. Its totient is φ = 614127920.
The previous prime is 1013311099. The next prime is 1013311109. The reversal of 1013311101 is 1011133101.
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 1013311101 - 21 = 1013311099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013311109) 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, 15353166 + ... + 15353231.
It is an arithmetic number, because the mean of its divisors is an integer number (184238388).
Almost surely, 21013311101 is an apocalyptic number.
1013311101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1013311101 is a deficient number, since it is larger than the sum of its proper divisors (460596003).
1013311101 is a wasteful number, since it uses less digits than its factorization.
1013311101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30706411.
The product of its (nonzero) digits is 9, while the sum is 12.
The square root of 1013311101 is about 31832.5478245145. The cubic root of 1013311101 is about 1004.4174907079.
Adding to 1013311101 its reverse (1011133101), we get a palindrome (2024444202).
The spelling of 1013311101 in words is "one billion, thirteen million, three hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •