Base | Representation |
---|---|
bin | 100110111011110… |
… | …0001111100110000 |
3 | 10101001020010110210 |
4 | 1031313201330300 |
5 | 10133414340413 |
6 | 333344424120 |
7 | 44242144650 |
oct | 11567417460 |
9 | 3331203423 |
10 | 1306402608 |
11 | 610480685 |
12 | 305618040 |
13 | 17a86a2c4 |
14 | c570a360 |
15 | 79a573c3 |
hex | 4dde1f30 |
1306402608 has 160 divisors (see below), whose sum is σ = 4155289600. Its totient is φ = 345316608.
The previous prime is 1306402583. The next prime is 1306402613. The reversal of 1306402608 is 8062046031.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 272133 + ... + 276891.
It is an arithmetic number, because the mean of its divisors is an integer number (25970560).
Almost surely, 21306402608 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 1306402608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2077644800).
1306402608 is an abundant number, since it is smaller than the sum of its proper divisors (2848886992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1306402608 is a wasteful number, since it uses less digits than its factorization.
1306402608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4839 (or 4833 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
The square root of 1306402608 is about 36144.1918985610. The cubic root of 1306402608 is about 1093.1816831438.
Adding to 1306402608 its reverse (8062046031), we get a palindrome (9368448639).
The spelling of 1306402608 in words is "one billion, three hundred six million, four hundred two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •