Base | Representation |
---|---|
bin | 10100101100111001… |
… | …11110100100101011 |
3 | 1001200120011110021210 |
4 | 22112130332210223 |
5 | 140230203111243 |
6 | 5034502004203 |
7 | 542263255515 |
oct | 122634764453 |
9 | 31616143253 |
10 | 11114113323 |
11 | 4793699925 |
12 | 21a2116663 |
13 | 1081770021 |
14 | 7760d6bb5 |
15 | 450ad0933 |
hex | 29673e92b |
11114113323 has 8 divisors (see below), whose sum is σ = 15329811600. Its totient is φ = 7153911968.
The previous prime is 11114113277. The next prime is 11114113331. The reversal of 11114113323 is 32331141111.
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 11114113323 - 28 = 11114113067 is a prime.
It is a super-2 number, since 2×111141133232 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11114113323.
It is not an unprimeable number, because it can be changed into a prime (11114112323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63874128 + ... + 63874301.
It is an arithmetic number, because the mean of its divisors is an integer number (1916226450).
Almost surely, 211114113323 is an apocalyptic number.
11114113323 is a deficient number, since it is larger than the sum of its proper divisors (4215698277).
11114113323 is a wasteful number, since it uses less digits than its factorization.
11114113323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127748461.
The product of its digits is 216, while the sum is 21.
Adding to 11114113323 its reverse (32331141111), we get a palindrome (43445254434).
The spelling of 11114113323 in words is "eleven billion, one hundred fourteen million, one hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •