Base | Representation |
---|---|
bin | 101110110010… |
… | …011010101101 |
3 | 212002010121012 |
4 | 232302122231 |
5 | 11114441013 |
6 | 1114515005 |
7 | 206152256 |
oct | 56623255 |
9 | 25063535 |
10 | 12265133 |
11 | 6a17a81 |
12 | 4135a65 |
13 | 270589a |
14 | 18b3b2d |
15 | 11241a8 |
hex | bb26ad |
12265133 has 4 divisors (see below), whose sum is σ = 12373788. Its totient is φ = 12156480.
The previous prime is 12265129. The next prime is 12265147. The reversal of 12265133 is 33156221.
12265133 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4937284 + 7327849 = 2222^2 + 2707^2 .
It is a cyclic number.
It is not a de Polignac number, because 12265133 - 22 = 12265129 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12265099 and 12265108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12265153) 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, 54158 + ... + 54383.
It is an arithmetic number, because the mean of its divisors is an integer number (3093447).
Almost surely, 212265133 is an apocalyptic number.
It is an amenable number.
12265133 is a deficient number, since it is larger than the sum of its proper divisors (108655).
12265133 is a wasteful number, since it uses less digits than its factorization.
12265133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108654.
The product of its digits is 1080, while the sum is 23.
The square root of 12265133 is about 3502.1611898940. The cubic root of 12265133 is about 230.6167003474.
The spelling of 12265133 in words is "twelve million, two hundred sixty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •