Base | Representation |
---|---|
bin | 1000011010111000… |
… | …1110010101010000 |
3 | 12211112002022200120 |
4 | 2012232032111100 |
5 | 14112111424042 |
6 | 1012141150240 |
7 | 110003633520 |
oct | 20656162520 |
9 | 5745068616 |
10 | 2260264272 |
11 | a5a951002 |
12 | 530b5b380 |
13 | 2a03719a6 |
14 | 176287680 |
15 | d3672dec |
hex | 86b8e550 |
2260264272 has 80 divisors (see below), whose sum is σ = 6690702720. Its totient is φ = 644092416.
The previous prime is 2260264261. The next prime is 2260264273. The reversal of 2260264272 is 2724620622.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2260264273) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 122058 + ... + 139350.
It is an arithmetic number, because the mean of its divisors is an integer number (83633784).
Almost surely, 22260264272 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 2260264272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3345351360).
2260264272 is an abundant number, since it is smaller than the sum of its proper divisors (4430438448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2260264272 is a wasteful number, since it uses less digits than its factorization.
2260264272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17700 (or 17694 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 33.
The square root of 2260264272 is about 47542.2367164188. The cubic root of 2260264272 is about 1312.3602675369.
Adding to 2260264272 its reverse (2724620622), we get a palindrome (4984884894).
The spelling of 2260264272 in words is "two billion, two hundred sixty million, two hundred sixty-four thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •