Base | Representation |
---|---|
bin | 10001101100110011100… |
… | …010001010111011010011 |
3 | 11022021120211221102002100 |
4 | 101230303202022323103 |
5 | 124412031111343220 |
6 | 2330440134451443 |
7 | 153610022206353 |
oct | 21546342127323 |
9 | 4267524842070 |
10 | 1216340340435 |
11 | 429935459780 |
12 | 177899b03b83 |
13 | 8a914a244bc |
14 | 42c2a770b63 |
15 | 2198e50cd90 |
hex | 11b3388aed3 |
1216340340435 has 48 divisors (see below), whose sum is σ = 2362150908000. Its totient is φ = 573801822720.
The previous prime is 1216340340349. The next prime is 1216340340539. The reversal of 1216340340435 is 5340430436121.
1216340340435 is a `hidden beast` number, since 1 + 216 + 3 + 4 + 0 + 3 + 4 + 0 + 435 = 666.
It is not a de Polignac number, because 1216340340435 - 27 = 1216340340307 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1216340340435.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 33187810 + ... + 33224439.
It is an arithmetic number, because the mean of its divisors is an integer number (49211477250).
Almost surely, 21216340340435 is an apocalyptic number.
1216340340435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1216340340435 is a deficient number, since it is larger than the sum of its proper divisors (1145810567565).
1216340340435 is a wasteful number, since it uses less digits than its factorization.
1216340340435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66412308 (or 66412305 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 36.
Adding to 1216340340435 its reverse (5340430436121), we get a palindrome (6556770776556).
The spelling of 1216340340435 in words is "one trillion, two hundred sixteen billion, three hundred forty million, three hundred forty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •