Base | Representation |
---|---|
bin | 100110101111110… |
… | …0010001110110111 |
3 | 10100121101112210211 |
4 | 1031133202032313 |
5 | 10130312043221 |
6 | 333001530251 |
7 | 44134525621 |
oct | 11537421667 |
9 | 3317345724 |
10 | 1300112311 |
11 | 607974693 |
12 | 3034a3987 |
13 | 179477134 |
14 | c494dc11 |
15 | 792136e1 |
hex | 4d7e23b7 |
1300112311 has 8 divisors (see below), whose sum is σ = 1363888800. Its totient is φ = 1237598880.
The previous prime is 1300112279. The next prime is 1300112351. The reversal of 1300112311 is 1132110031.
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 1300112311 - 25 = 1300112279 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1300112291 and 1300112300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300112351) 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, 313656 + ... + 317773.
It is an arithmetic number, because the mean of its divisors is an integer number (170486100).
Almost surely, 21300112311 is an apocalyptic number.
1300112311 is a deficient number, since it is larger than the sum of its proper divisors (63776489).
1300112311 is an equidigital number, since it uses as much as digits as its factorization.
1300112311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 631529.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1300112311 is about 36057.0701943461. The cubic root of 1300112311 is about 1091.4243117525.
Adding to 1300112311 its reverse (1132110031), we get a palindrome (2432222342).
The spelling of 1300112311 in words is "one billion, three hundred million, one hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •