Base | Representation |
---|---|
bin | 1010000001000111100111… |
… | …0101001101110110010011 |
3 | 1102222221221022011021211211 |
4 | 2200101321311031312103 |
5 | 2420424332033443220 |
6 | 35231530142320551 |
7 | 2214521421313042 |
oct | 240217165156623 |
9 | 42887838137754 |
10 | 11014340140435 |
11 | 3567178958745 |
12 | 129a7a0289157 |
13 | 61b856346458 |
14 | 2a114dcb0559 |
15 | 1417955c9b5a |
hex | a0479d4dd93 |
11014340140435 has 8 divisors (see below), whose sum is σ = 13353468047136. Its totient is φ = 8720632193280.
The previous prime is 11014340140429. The next prime is 11014340140493. The reversal of 11014340140435 is 53404104341011.
11014340140435 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11014340140435 - 29 = 11014340139923 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11014340140397 and 11014340140406.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11354989351 + ... + 11354990320.
It is an arithmetic number, because the mean of its divisors is an integer number (1669183505892).
Almost surely, 211014340140435 is an apocalyptic number.
11014340140435 is a deficient number, since it is larger than the sum of its proper divisors (2339127906701).
11014340140435 is an equidigital number, since it uses as much as digits as its factorization.
11014340140435 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22709979773.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 11014340140435 its reverse (53404104341011), we get a palindrome (64418444481446).
The spelling of 11014340140435 in words is "eleven trillion, fourteen billion, three hundred forty million, one hundred forty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •