Base | Representation |
---|---|
bin | 100100100000111… |
… | …0010100100010001 |
3 | 10011101102220201020 |
4 | 1021001302210101 |
5 | 10002123043113 |
6 | 321324230053 |
7 | 42235036152 |
oct | 11101624421 |
9 | 3141386636 |
10 | 1225206033 |
11 | 579662477 |
12 | 2a239b329 |
13 | 166aab3ac |
14 | b8a11929 |
15 | 72869023 |
hex | 49072911 |
1225206033 has 8 divisors (see below), whose sum is σ = 1656616896. Its totient is φ = 805299600.
The previous prime is 1225206029. The next prime is 1225206041. The reversal of 1225206033 is 3306025221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1225206033 - 22 = 1225206029 is a prime.
It is a super-2 number, since 2×12252060332 = 3002259646599194178, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1225205994 and 1225206012.
It is not an unprimeable number, because it can be changed into a prime (1225206083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2875858 + ... + 2876283.
It is an arithmetic number, because the mean of its divisors is an integer number (207077112).
Almost surely, 21225206033 is an apocalyptic number.
It is an amenable number.
1225206033 is a deficient number, since it is larger than the sum of its proper divisors (431410863).
1225206033 is an equidigital number, since it uses as much as digits as its factorization.
1225206033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5752215.
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 1225206033 is about 35002.9432048221. The cubic root of 1225206033 is about 1070.0474643399.
The spelling of 1225206033 in words is "one billion, two hundred twenty-five million, two hundred six thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •