Base | Representation |
---|---|
bin | 10101101001101001… |
… | …01011011101011001 |
3 | 1010000001221020120011 |
4 | 22310310223131121 |
5 | 142301123033334 |
6 | 5201223001521 |
7 | 561021222631 |
oct | 126464533531 |
9 | 33001836504 |
10 | 11623642969 |
11 | 4a25275004 |
12 | 23048992a1 |
13 | 11331b0863 |
14 | 7c3a4d6c1 |
15 | 4806cc564 |
hex | 2b4d2b759 |
11623642969 has 9 divisors (see below), whose sum is σ = 11727299829. Its totient is φ = 11520897180.
The previous prime is 11623642937. The next prime is 11623642973. The reversal of 11623642969 is 96924632611.
The square root of 11623642969 is 107813.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 11623642969 - 25 = 11623642937 is a prime.
It is a super-2 number, since 2×116236429692 (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 (11623642669) 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 8 ways as a sum of consecutive naturals, for example, 14123092 + ... + 14123914.
Almost surely, 211623642969 is an apocalyptic number.
11623642969 is the 107813-rd square number.
11623642969 is the 53907-th centered octagonal number.
It is an amenable number.
11623642969 is a deficient number, since it is larger than the sum of its proper divisors (103656860).
11623642969 is an frugal number, since it uses more digits than its factorization.
11623642969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1908 (or 954 counting only the distinct ones).
The product of its digits is 839808, while the sum is 49.
Multiplying 11623642969 by its sum of digits (49), we get a square (569558505481 = 7546912).
The spelling of 11623642969 in words is "eleven billion, six hundred twenty-three million, six hundred forty-two thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •