Base | Representation |
---|---|
bin | 110100100111101100… |
… | …1000001110111100101 |
3 | 101210200020112012201211 |
4 | 1221033121001313211 |
5 | 3322411241023023 |
6 | 123524553551421 |
7 | 11110162411150 |
oct | 1511731016745 |
9 | 353606465654 |
10 | 113001111013 |
11 | 43a181aa24a |
12 | 19a97a15571 |
13 | a86b1b003b |
14 | 567d9d8c97 |
15 | 2e1580aa0d |
hex | 1a4f641de5 |
113001111013 has 4 divisors (see below), whose sum is σ = 129144126880. Its totient is φ = 96858095148.
The previous prime is 113001111007. The next prime is 113001111029. The reversal of 113001111013 is 310111100311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113001111013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113001110984 and 113001111002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113001111313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8071507923 + ... + 8071507936.
It is an arithmetic number, because the mean of its divisors is an integer number (32286031720).
Almost surely, 2113001111013 is an apocalyptic number.
It is an amenable number.
113001111013 is a deficient number, since it is larger than the sum of its proper divisors (16143015867).
113001111013 is an equidigital number, since it uses as much as digits as its factorization.
113001111013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16143015866.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 113001111013 its reverse (310111100311), we get a palindrome (423112211324).
The spelling of 113001111013 in words is "one hundred thirteen billion, one million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •