Base | Representation |
---|---|
bin | 100110111011001… |
… | …1111001101100101 |
3 | 10101000201020111112 |
4 | 1031312133031211 |
5 | 10133332114003 |
6 | 333334514405 |
7 | 44236626002 |
oct | 11566371545 |
9 | 3330636445 |
10 | 1306129253 |
11 | 610304270 |
12 | 305505a05 |
13 | 17a7a2a60 |
14 | c56788a9 |
15 | 79a013d8 |
hex | 4dd9f365 |
1306129253 has 8 divisors (see below), whose sum is σ = 1534473696. Its totient is φ = 1096052400.
The previous prime is 1306129219. The next prime is 1306129271. The reversal of 1306129253 is 3529216031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1306129253 - 26 = 1306129189 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1306129283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4566743 + ... + 4567028.
It is an arithmetic number, because the mean of its divisors is an integer number (191809212).
Almost surely, 21306129253 is an apocalyptic number.
1306129253 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1306129253 is a deficient number, since it is larger than the sum of its proper divisors (228344443).
1306129253 is a wasteful number, since it uses less digits than its factorization.
1306129253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9133795.
The product of its (nonzero) digits is 9720, while the sum is 32.
The square root of 1306129253 is about 36140.4102494701. The cubic root of 1306129253 is about 1093.1054311212.
The spelling of 1306129253 in words is "one billion, three hundred six million, one hundred twenty-nine thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •