Base | Representation |
---|---|
bin | 1010000110111010111100… |
… | …1111010100101000010110 |
3 | 1110100111020012012100220000 |
4 | 2201232233033110220112 |
5 | 2424043003212033324 |
6 | 35345413244552130 |
7 | 2224650533614221 |
oct | 241565717245026 |
9 | 43314205170800 |
10 | 11114020424214 |
11 | 35a547a873264 |
12 | 12b5b7ab52646 |
13 | 628080843ba6 |
14 | 2a5cc86a85b8 |
15 | 14417b70d9c9 |
hex | a1baf3d4a16 |
11114020424214 has 80 divisors (see below), whose sum is σ = 25014584216160. Its totient is φ = 3688205840640.
The previous prime is 11114020424167. The next prime is 11114020424237. The reversal of 11114020424214 is 41242402041111.
11114020424214 is a `hidden beast` number, since 1 + 1 + 1 + 1 + 4 + 0 + 20 + 424 + 214 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
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 39 ways as a sum of consecutive naturals, for example, 32615902 + ... + 32954894.
It is an arithmetic number, because the mean of its divisors is an integer number (312682302702).
Almost surely, 211114020424214 is an apocalyptic number.
11114020424214 is an abundant number, since it is smaller than the sum of its proper divisors (13900563791946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11114020424214 is a wasteful number, since it uses less digits than its factorization.
11114020424214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339907 (or 339898 counting only the distinct ones).
The product of its (nonzero) digits is 2048, while the sum is 27.
Adding to 11114020424214 its reverse (41242402041111), we get a palindrome (52356422465325).
The spelling of 11114020424214 in words is "eleven trillion, one hundred fourteen billion, twenty million, four hundred twenty-four thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •