Base | Representation |
---|---|
bin | 1010000000110111111010… |
… | …1011111101101010000001 |
3 | 1102222120001122200222002011 |
4 | 2200031332223331222001 |
5 | 2420342214404233401 |
6 | 35225552104252521 |
7 | 2214312126145414 |
oct | 240157653755201 |
9 | 42876048628064 |
10 | 11010126633601 |
11 | 35654064a6697 |
12 | 1299a05171141 |
13 | 61b33441b944 |
14 | 2a0c7045db7b |
15 | 1415ea72d451 |
hex | a037eafda81 |
11010126633601 has 8 divisors (see below), whose sum is σ = 11085650121600. Its totient is φ = 10934793622272.
The previous prime is 11010126633577. The next prime is 11010126633629. The reversal of 11010126633601 is 10633662101011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11010126633601 - 225 = 11010093079169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11010126633901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47503165 + ... + 47734378.
It is an arithmetic number, because the mean of its divisors is an integer number (1385706265200).
Almost surely, 211010126633601 is an apocalyptic number.
It is an amenable number.
11010126633601 is a deficient number, since it is larger than the sum of its proper divisors (75523487999).
11010126633601 is an equidigital number, since it uses as much as digits as its factorization.
11010126633601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95238335.
The product of its (nonzero) digits is 3888, while the sum is 31.
Adding to 11010126633601 its reverse (10633662101011), we get a palindrome (21643788734612).
The spelling of 11010126633601 in words is "eleven trillion, ten billion, one hundred twenty-six million, six hundred thirty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •