Base | Representation |
---|---|
bin | 10100011111010011… |
… | …10111010100111001 |
3 | 1001101121112111012100 |
4 | 22033221313110321 |
5 | 140012003113001 |
6 | 5015305134013 |
7 | 536406614352 |
oct | 121751672471 |
9 | 31347474170 |
10 | 11000051001 |
11 | 4735273145 |
12 | 216ba8a309 |
13 | 1063c44924 |
14 | 764cc4d29 |
15 | 445a9e586 |
hex | 28fa77539 |
11000051001 has 12 divisors (see below), whose sum is σ = 16579787328. Its totient is φ = 7014525144.
The previous prime is 11000050981. The next prime is 11000051003. The reversal of 11000051001 is 10015000011.
It is not a de Polignac number, because 11000051001 - 26 = 11000050937 is a prime.
It is a super-2 number, since 2×110000510012 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (11000051003) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26569965 + ... + 26570378.
It is an arithmetic number, because the mean of its divisors is an integer number (1381648944).
Almost surely, 211000051001 is an apocalyptic number.
It is an amenable number.
11000051001 is a deficient number, since it is larger than the sum of its proper divisors (5579736327).
11000051001 is a wasteful number, since it uses less digits than its factorization.
11000051001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53140372 (or 53140369 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
Adding to 11000051001 its reverse (10015000011), we get a palindrome (21015051012).
The spelling of 11000051001 in words is "eleven billion, fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •