Base | Representation |
---|---|
bin | 1010000000100111000110… |
… | …0000101100110110000011 |
3 | 1102222010101221000012101200 |
4 | 2200021301200230312003 |
5 | 2420303442304010201 |
6 | 35223524022232243 |
7 | 2214062201450121 |
oct | 240116140546603 |
9 | 42863357005350 |
10 | 11005610610051 |
11 | 35634a9301322 |
12 | 1298b64885683 |
13 | 61aa94924965 |
14 | 2a0962782911 |
15 | 141434027386 |
hex | a027182cd83 |
11005610610051 has 12 divisors (see below), whose sum is σ = 15916169221680. Its totient is φ = 7328223223920.
The previous prime is 11005610610047. The next prime is 11005610610061. The reversal of 11005610610051 is 15001601650011.
It is not a de Polignac number, because 11005610610051 - 22 = 11005610610047 is a prime.
It is a super-2 number, since 2×110056106100512 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11005610609997 and 11005610610024.
It is not an unprimeable number, because it can be changed into a prime (11005610610061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 737535135 + ... + 737550056.
It is an arithmetic number, because the mean of its divisors is an integer number (1326347435140).
Almost surely, 211005610610051 is an apocalyptic number.
11005610610051 is a deficient number, since it is larger than the sum of its proper divisors (4910558611629).
11005610610051 is a wasteful number, since it uses less digits than its factorization.
11005610610051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1475086026 (or 1475086023 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
The spelling of 11005610610051 in words is "eleven trillion, five billion, six hundred ten million, six hundred ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •