Base | Representation |
---|---|
bin | 110010011110… |
… | …011110001011 |
3 | 220220020220111 |
4 | 302132132023 |
5 | 11341411021 |
6 | 1151335151 |
7 | 220320202 |
oct | 62363613 |
9 | 26806814 |
10 | 13232011 |
11 | 7518451 |
12 | 45214b7 |
13 | 29839c0 |
14 | 1a86239 |
15 | 12658e1 |
hex | c9e78b |
13232011 has 4 divisors (see below), whose sum is σ = 14249872. Its totient is φ = 12214152.
The previous prime is 13231997. The next prime is 13232017. The reversal of 13232011 is 11023231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13232011 - 223 = 4843403 is a prime.
It is a super-2 number, since 2×132320112 = 350172230208242, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13), and also a Moran number because the ratio is a prime number: 1017847 = 13232011 / (1 + 3 + 2 + 3 + 2 + 0 + 1 + 1).
It is a junction number, because it is equal to n+sod(n) for n = 13231982 and 13232000.
It is not an unprimeable number, because it can be changed into a prime (13232017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 508911 + ... + 508936.
It is an arithmetic number, because the mean of its divisors is an integer number (3562468).
Almost surely, 213232011 is an apocalyptic number.
13232011 is a deficient number, since it is larger than the sum of its proper divisors (1017861).
13232011 is a wasteful number, since it uses less digits than its factorization.
13232011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1017860.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 13232011 is about 3637.5831261979. The cubic root of 13232011 is about 236.5240378018.
Adding to 13232011 its reverse (11023231), we get a palindrome (24255242).
The spelling of 13232011 in words is "thirteen million, two hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •