Base | Representation |
---|---|
bin | 100100100001100… |
… | …0010001010010011 |
3 | 10011102001110220222 |
4 | 1021003002022103 |
5 | 10002214011201 |
6 | 321335223255 |
7 | 42240564512 |
oct | 11103021223 |
9 | 3142043828 |
10 | 1225532051 |
11 | 579865407 |
12 | 2a2517b2b |
13 | 166b938c3 |
14 | b8a98679 |
15 | 728d091b |
hex | 490c2293 |
1225532051 has 8 divisors (see below), whose sum is σ = 1233416304. Its totient is φ = 1217664000.
The previous prime is 1225532039. The next prime is 1225532059. The reversal of 1225532051 is 1502355221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1225532051 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1225532051.
It is not an unprimeable number, because it can be changed into a prime (1225532059) 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, 171551 + ... + 178551.
It is an arithmetic number, because the mean of its divisors is an integer number (154177038).
Almost surely, 21225532051 is an apocalyptic number.
1225532051 is a deficient number, since it is larger than the sum of its proper divisors (7884253).
1225532051 is an equidigital number, since it uses as much as digits as its factorization.
1225532051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8101.
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 1225532051 is about 35007.5999034495. The cubic root of 1225532051 is about 1070.1423664181.
Adding to 1225532051 its reverse (1502355221), we get a palindrome (2727887272).
The spelling of 1225532051 in words is "one billion, two hundred twenty-five million, five hundred thirty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •