Base | Representation |
---|---|
bin | 111100011000010… |
… | …010101110001101 |
3 | 2121121010210021022 |
4 | 330120102232031 |
5 | 4033312013401 |
6 | 244304043525 |
7 | 34050236660 |
oct | 7430225615 |
9 | 2547123238 |
10 | 1013001101 |
11 | 47a8a37a2 |
12 | 2433035a5 |
13 | 131b3ca48 |
14 | 987736d7 |
15 | 5dded71b |
hex | 3c612b8d |
1013001101 has 4 divisors (see below), whose sum is σ = 1157715552. Its totient is φ = 868286652.
The previous prime is 1013001097. The next prime is 1013001127. The reversal of 1013001101 is 1011003101.
1013001101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 not a de Polignac number, because 1013001101 - 22 = 1013001097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013001901) 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, 72357215 + ... + 72357228.
It is an arithmetic number, because the mean of its divisors is an integer number (289428888).
Almost surely, 21013001101 is an apocalyptic number.
It is an amenable number.
1013001101 is a deficient number, since it is larger than the sum of its proper divisors (144714451).
1013001101 is an equidigital number, since it uses as much as digits as its factorization.
1013001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144714450.
The product of its (nonzero) digits is 3, while the sum is 8.
The square root of 1013001101 is about 31827.6782219502. The cubic root of 1013001101 is about 1004.3150538618.
Adding to 1013001101 its reverse (1011003101), we get a palindrome (2024004202).
The spelling of 1013001101 in words is "one billion, thirteen million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •