Base | Representation |
---|---|
bin | 1111000010111… |
… | …11101111010001 |
3 | 22210111201000200 |
4 | 13201133233101 |
5 | 224303040030 |
6 | 20305205413 |
7 | 3061602012 |
oct | 741375721 |
9 | 283451020 |
10 | 126221265 |
11 | 652809a5 |
12 | 36330869 |
13 | 201c4851 |
14 | 12a99009 |
15 | b133d60 |
hex | 785fbd1 |
126221265 has 12 divisors (see below), whose sum is σ = 218783604. Its totient is φ = 67317984.
The previous prime is 126221257. The next prime is 126221279. The reversal of 126221265 is 562122621.
126221265 is a `hidden beast` number, since 12 + 622 + 1 + 26 + 5 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 27973521 + 98247744 = 5289^2 + 9912^2 .
It is not a de Polignac number, because 126221265 - 23 = 126221257 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1402414 + ... + 1402503.
It is an arithmetic number, because the mean of its divisors is an integer number (18231967).
Almost surely, 2126221265 is an apocalyptic number.
126221265 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
126221265 is a deficient number, since it is larger than the sum of its proper divisors (92562339).
126221265 is a wasteful number, since it uses less digits than its factorization.
126221265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2804928 (or 2804925 counting only the distinct ones).
The product of its digits is 2880, while the sum is 27.
The square root of 126221265 is about 11234.8237636378. The cubic root of 126221265 is about 501.6230788623.
Adding to 126221265 its reverse (562122621), we get a palindrome (688343886).
The spelling of 126221265 in words is "one hundred twenty-six million, two hundred twenty-one thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •