Base | Representation |
---|---|
bin | 1010010001111111110110… |
… | …0000011101010100001011 |
3 | 1111000200101221120002100220 |
4 | 2210133331200131110023 |
5 | 2440202212344200412 |
6 | 40013043532001123 |
7 | 2244465251306265 |
oct | 244377540352413 |
9 | 44020357502326 |
10 | 11304312100107 |
11 | 366914a528904 |
12 | 1326a273001a3 |
13 | 63ccb871a890 |
14 | 2b11bb270b35 |
15 | 1490b76dc68c |
hex | a47fd81d50b |
11304312100107 has 16 divisors (see below), whose sum is σ = 16474098923520. Its totient is φ = 6852671397792.
The previous prime is 11304312100073. The next prime is 11304312100127. The reversal of 11304312100107 is 70100121340311.
It is not a de Polignac number, because 11304312100107 - 27 = 11304312099979 is a prime.
It is a super-3 number, since 3×113043121001073 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (11304312100127) 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 15 ways as a sum of consecutive naturals, for example, 2163088107 + ... + 2163093332.
It is an arithmetic number, because the mean of its divisors is an integer number (1029631182720).
Almost surely, 211304312100107 is an apocalyptic number.
11304312100107 is a deficient number, since it is larger than the sum of its proper divisors (5169786823413).
11304312100107 is a wasteful number, since it uses less digits than its factorization.
11304312100107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4326181522.
The product of its (nonzero) digits is 504, while the sum is 24.
Adding to 11304312100107 its reverse (70100121340311), we get a palindrome (81404433440418).
The spelling of 11304312100107 in words is "eleven trillion, three hundred four billion, three hundred twelve million, one hundred thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •