Base | Representation |
---|---|
bin | 111111001111110… |
… | …001110111001001 |
3 | 2201221122111221002 |
4 | 333033301313021 |
5 | 4133120213001 |
6 | 253143024345 |
7 | 35203131632 |
oct | 7717616711 |
9 | 2657574832 |
10 | 1061101001 |
11 | 4a4a66984 |
12 | 25743b0b5 |
13 | 13bab131c |
14 | a0cd4889 |
15 | 6325046b |
hex | 3f3f1dc9 |
1061101001 has 4 divisors (see below), whose sum is σ = 1061250000. Its totient is φ = 1060952004.
The previous prime is 1061100991. The next prime is 1061101003. The reversal of 1061101001 is 1001011601.
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 1061101001 - 226 = 993992137 is a prime.
It is a super-3 number, since 3×10611010013 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1061101003) 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, 63251 + ... + 78248.
It is an arithmetic number, because the mean of its divisors is an integer number (265312500).
Almost surely, 21061101001 is an apocalyptic number.
It is an amenable number.
1061101001 is a deficient number, since it is larger than the sum of its proper divisors (148999).
1061101001 is an equidigital number, since it uses as much as digits as its factorization.
1061101001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 148998.
The product of its (nonzero) digits is 6, while the sum is 11.
The square root of 1061101001 is about 32574.5452922984. The cubic root of 1061101001 is about 1019.9657174816.
Adding to 1061101001 its reverse (1001011601), we get a palindrome (2062112602).
The spelling of 1061101001 in words is "one billion, sixty-one million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •