Base | Representation |
---|---|
bin | 100110000100001… |
… | …0010001111010000 |
3 | 10022000100112021021 |
4 | 1030020102033100 |
5 | 10103433142042 |
6 | 330423405224 |
7 | 43436235400 |
oct | 11410221720 |
9 | 3260315237 |
10 | 1277240272 |
11 | 5a5a72580 |
12 | 2b78b3814 |
13 | 1747c9699 |
14 | c18b8800 |
15 | 771e6867 |
hex | 4c2123d0 |
1277240272 has 120 divisors (see below), whose sum is σ = 3249300960. Its totient is φ = 480372480.
The previous prime is 1277240257. The next prime is 1277240291. The reversal of 1277240272 is 2720427721.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 247543 + ... + 252649.
It is an arithmetic number, because the mean of its divisors is an integer number (27077508).
Almost surely, 21277240272 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1277240272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1624650480).
1277240272 is an abundant number, since it is smaller than the sum of its proper divisors (1972060688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1277240272 is a wasteful number, since it uses less digits than its factorization.
1277240272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5169 (or 5156 counting only the distinct ones).
The product of its (nonzero) digits is 21952, while the sum is 34.
The square root of 1277240272 is about 35738.4984575458. The cubic root of 1277240272 is about 1084.9861670106.
Adding to 1277240272 its reverse (2720427721), we get a palindrome (3997667993).
The spelling of 1277240272 in words is "one billion, two hundred seventy-seven million, two hundred forty thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •