Base | Representation |
---|---|
bin | 10100100001000000… |
… | …10011101101000011 |
3 | 1001102121101120201022 |
4 | 22100200103231003 |
5 | 140024131314021 |
6 | 5020535100055 |
7 | 536642125616 |
oct | 122040235503 |
9 | 31377346638 |
10 | 11014323011 |
11 | 474233099a |
12 | 217481162b |
13 | 1066ba0ac3 |
14 | 766b5c17d |
15 | 446e6d1ab |
hex | 290813b43 |
11014323011 has 8 divisors (see below), whose sum is σ = 11096964144. Its totient is φ = 10931900320.
The previous prime is 11014322951. The next prime is 11014323029. The reversal of 11014323011 is 11032341011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11014323011 - 26 = 11014322947 is a prime.
It is a super-2 number, since 2×110143230112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11014323041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47321 + ... + 155781.
It is an arithmetic number, because the mean of its divisors is an integer number (1387120518).
Almost surely, 211014323011 is an apocalyptic number.
11014323011 is a deficient number, since it is larger than the sum of its proper divisors (82641133).
11014323011 is a wasteful number, since it uses less digits than its factorization.
11014323011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109221.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11014323011 its reverse (11032341011), we get a palindrome (22046664022).
The spelling of 11014323011 in words is "eleven billion, fourteen million, three hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •