Base | Representation |
---|---|
bin | 1001101100011101… |
… | …1111001100101000 |
3 | 20201100221012120102 |
4 | 2123013133030220 |
5 | 20312210300042 |
6 | 1110123044532 |
7 | 121330205120 |
oct | 23307371450 |
9 | 6640835512 |
10 | 2602431272 |
11 | 1116006151 |
12 | 607670748 |
13 | 32621477c |
14 | 1a98b5c80 |
15 | 103710b32 |
hex | 9b1df328 |
2602431272 has 64 divisors (see below), whose sum is σ = 5661964800. Its totient is φ = 1098339840.
The previous prime is 2602431263. The next prime is 2602431277. The reversal of 2602431272 is 2721342062.
It is not an unprimeable number, because it can be changed into a prime (2602431277) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3366278 + ... + 3367050.
It is an arithmetic number, because the mean of its divisors is an integer number (88468200).
Almost surely, 22602431272 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 2602431272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2830982400).
2602431272 is an abundant number, since it is smaller than the sum of its proper divisors (3059533528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2602431272 is a wasteful number, since it uses less digits than its factorization.
2602431272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1626 (or 1622 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 29.
The square root of 2602431272 is about 51014.0301485778. The cubic root of 2602431272 is about 1375.4973446261.
The spelling of 2602431272 in words is "two billion, six hundred two million, four hundred thirty-one thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •