Base | Representation |
---|---|
bin | 100100011100111… |
… | …0000101001100001 |
3 | 10011020110222011222 |
4 | 1020321300221201 |
5 | 10001103213100 |
6 | 321211144425 |
7 | 42211121126 |
oct | 11071605141 |
9 | 3136428158 |
10 | 1223101025 |
11 | 5784549a3 |
12 | 2a1745115 |
13 | 166522223 |
14 | b862474d |
15 | 725a0485 |
hex | 48e70a61 |
1223101025 has 12 divisors (see below), whose sum is σ = 1538008704. Its totient is φ = 964698000.
The previous prime is 1223101007. The next prime is 1223101037. The reversal of 1223101025 is 5201013221.
It is a happy number.
It is not a de Polignac number, because 1223101025 - 26 = 1223100961 is a prime.
It is a super-2 number, since 2×12231010252 = 2991952234712101250, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1223100994 and 1223101012.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 342761 + ... + 346310.
It is an arithmetic number, because the mean of its divisors is an integer number (128167392).
Almost surely, 21223101025 is an apocalyptic number.
It is an amenable number.
1223101025 is a deficient number, since it is larger than the sum of its proper divisors (314907679).
1223101025 is an equidigital number, since it uses as much as digits as its factorization.
1223101025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 689152 (or 689147 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 1223101025 is about 34972.8612641288. The cubic root of 1223101025 is about 1069.4343022495.
Adding to 1223101025 its reverse (5201013221), we get a palindrome (6424114246).
The spelling of 1223101025 in words is "one billion, two hundred twenty-three million, one hundred one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •