Base | Representation |
---|---|
bin | 101010001100… |
… | …001100100001 |
3 | 202210220110200 |
4 | 222030030201 |
5 | 10312410001 |
6 | 1033015413 |
7 | 163002621 |
oct | 52141441 |
9 | 22726420 |
10 | 11060001 |
11 | 62745a7 |
12 | 3854569 |
13 | 23a31a4 |
14 | 167c881 |
15 | e87086 |
hex | a8c321 |
11060001 has 6 divisors (see below), whose sum is σ = 15975570. Its totient is φ = 7373328.
The previous prime is 11059973. The next prime is 11060029. The reversal of 11060001 is 10006011.
It is an interprime number because it is at equal distance from previous prime (11059973) and next prime (11060029).
It can be written as a sum of positive squares in only one way, i.e., 11048976 + 11025 = 3324^2 + 105^2 .
It is not a de Polignac number, because 11060001 - 210 = 11058977 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1228889 = 11060001 / (1 + 1 + 0 + 6 + 0 + 0 + 0 + 1).
It is not an unprimeable number, because it can be changed into a prime (11060041) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 614436 + ... + 614453.
It is an arithmetic number, because the mean of its divisors is an integer number (2662595).
Almost surely, 211060001 is an apocalyptic number.
It is an amenable number.
11060001 is a deficient number, since it is larger than the sum of its proper divisors (4915569).
11060001 is a wasteful number, since it uses less digits than its factorization.
11060001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1228895 (or 1228892 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 11060001 is about 3325.6579800094. The cubic root of 11060001 is about 222.8016428081.
Adding to 11060001 its reverse (10006011), we get a palindrome (21066012).
The spelling of 11060001 in words is "eleven million, sixty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •