Base | Representation |
---|---|
bin | 10101000101110101… |
… | …00101000111100001 |
3 | 1002020010121011020122 |
4 | 22202322211013201 |
5 | 141142214344334 |
6 | 5111331250025 |
7 | 550412416544 |
oct | 124272450741 |
9 | 32203534218 |
10 | 11323199969 |
11 | 4890718804 |
12 | 2240149915 |
13 | 10b5b89233 |
14 | 795ba285b |
15 | 46413232e |
hex | 2a2ea51e1 |
11323199969 has 8 divisors (see below), whose sum is σ = 11789531880. Its totient is φ = 10865923200.
The previous prime is 11323199941. The next prime is 11323199983. The reversal of 11323199969 is 96999132311.
It can be written as a sum of positive squares in 4 ways, for example, as 26061025 + 11297138944 = 5105^2 + 106288^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11323199969 is a prime.
It is a super-2 number, since 2×113231999692 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11323199969.
It is not an unprimeable number, because it can be changed into a prime (11323199939) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2261234 + ... + 2266235.
It is an arithmetic number, because the mean of its divisors is an integer number (1473691485).
Almost surely, 211323199969 is an apocalyptic number.
It is an amenable number.
11323199969 is a deficient number, since it is larger than the sum of its proper divisors (466331911).
11323199969 is an equidigital number, since it uses as much as digits as its factorization.
11323199969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4527571.
The product of its digits is 708588, while the sum is 53.
The spelling of 11323199969 in words is "eleven billion, three hundred twenty-three million, one hundred ninety-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •