Base | Representation |
---|---|
bin | 1010000001000100001001… |
… | …1101010111101100100011 |
3 | 1102222212112120002022011111 |
4 | 2200101002131113230203 |
5 | 2420420431223024220 |
6 | 35231254034524151 |
7 | 2214456411051052 |
oct | 240210235275443 |
9 | 42885476068144 |
10 | 11013411142435 |
11 | 356684151a7a9 |
12 | 129a581136657 |
13 | 61b738a38bb0 |
14 | 2a10a2766399 |
15 | 14173dc7115a |
hex | a0442757b23 |
11013411142435 has 32 divisors (see below), whose sum is σ = 14973050232000. Its totient is φ = 7719439074816.
The previous prime is 11013411142411. The next prime is 11013411142453. The reversal of 11013411142435 is 53424111431011.
It is a de Polignac number, because none of the positive numbers 2k-11013411142435 is a prime.
It is a super-2 number, since 2×110134111424352 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11013411142397 and 11013411142406.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 49402840 + ... + 49625269.
It is an arithmetic number, because the mean of its divisors is an integer number (467907819750).
Almost surely, 211013411142435 is an apocalyptic number.
11013411142435 is a deficient number, since it is larger than the sum of its proper divisors (3959639089565).
11013411142435 is a wasteful number, since it uses less digits than its factorization.
11013411142435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99028215.
The product of its (nonzero) digits is 5760, while the sum is 31.
Adding to 11013411142435 its reverse (53424111431011), we get a palindrome (64437522573446).
The spelling of 11013411142435 in words is "eleven trillion, thirteen billion, four hundred eleven million, one hundred forty-two thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •