Base | Representation |
---|---|
bin | 1010000000010100001100… |
… | …0000101100010100011101 |
3 | 1102221122022020021220022000 |
4 | 2200011003000230110131 |
5 | 2420213044042000221 |
6 | 35221324245112513 |
7 | 2213522344644102 |
oct | 240050300542435 |
9 | 42848266256260 |
10 | 11000535500061 |
11 | 3561334563048 |
12 | 1297b890b8739 |
13 | 61a4663586b3 |
14 | 2a060072caa9 |
15 | 1412386d5e26 |
hex | a014302c51d |
11000535500061 has 16 divisors (see below), whose sum is σ = 17255741961600. Its totient is φ = 6902296784064.
The previous prime is 11000535500057. The next prime is 11000535500093. The reversal of 11000535500061 is 16000553500011.
11000535500061 is a `hidden beast` number, since 1 + 1 + 0 + 0 + 0 + 53 + 550 + 0 + 0 + 61 = 666.
It is not a de Polignac number, because 11000535500061 - 22 = 11000535500057 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 11000535499998 and 11000535500034.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000535500041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11983153681 + ... + 11983154598.
It is an arithmetic number, because the mean of its divisors is an integer number (1078483872600).
Almost surely, 211000535500061 is an apocalyptic number.
It is an amenable number.
11000535500061 is a deficient number, since it is larger than the sum of its proper divisors (6255206461539).
11000535500061 is a wasteful number, since it uses less digits than its factorization.
11000535500061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23966308305 (or 23966308299 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 27.
The spelling of 11000535500061 in words is "eleven trillion, five hundred thirty-five million, five hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.242 sec. • engine limits •