Base | Representation |
---|---|
bin | 100110101000000… |
… | …1100111000111000 |
3 | 10100022211022222101 |
4 | 1031100030320320 |
5 | 10123244431403 |
6 | 332335433144 |
7 | 44055415000 |
oct | 11520147070 |
9 | 3308738871 |
10 | 1296092728 |
11 | 605679717 |
12 | 3020857b4 |
13 | 17869a698 |
14 | c41c5000 |
15 | 78bbc71d |
hex | 4d40ce38 |
1296092728 has 64 divisors (see below), whose sum is σ = 2844576000. Its totient is φ = 553402080.
The previous prime is 1296092683. The next prime is 1296092729. The reversal of 1296092728 is 8272906921.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1296092729) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 907551 + ... + 908977.
It is an arithmetic number, because the mean of its divisors is an integer number (44446500).
Almost surely, 21296092728 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 1296092728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1422288000).
1296092728 is an abundant number, since it is smaller than the sum of its proper divisors (1548483272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1296092728 is a wasteful number, since it uses less digits than its factorization.
1296092728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1785 (or 1767 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 46.
The square root of 1296092728 is about 36001.2878658528. The cubic root of 1296092728 is about 1090.2983578505.
The spelling of 1296092728 in words is "one billion, two hundred ninety-six million, ninety-two thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •