Base | Representation |
---|---|
bin | 100110111001010… |
… | …1001110100000101 |
3 | 10100221211011200200 |
4 | 1031302221310011 |
5 | 10133102432401 |
6 | 333301201113 |
7 | 44225241351 |
oct | 11562516405 |
9 | 3327734620 |
10 | 1305124101 |
11 | 60a788066 |
12 | 305100199 |
13 | 17a5103a8 |
14 | c5496461 |
15 | 798a3686 |
hex | 4dca9d05 |
1305124101 has 12 divisors (see below), whose sum is σ = 1886658540. Its totient is φ = 869400000.
The previous prime is 1305124081. The next prime is 1305124109. The reversal of 1305124101 is 1014215031.
It can be written as a sum of positive squares in 2 ways, for example, as 555733476 + 749390625 = 23574^2 + 27375^2 .
It is not a de Polignac number, because 1305124101 - 210 = 1305123077 is a prime.
It is a super-2 number, since 2×13051241012 = 3406697838022116402, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1305124109) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 44650 + ... + 67851.
It is an arithmetic number, because the mean of its divisors is an integer number (157221545).
Almost surely, 21305124101 is an apocalyptic number.
It is an amenable number.
1305124101 is a deficient number, since it is larger than the sum of its proper divisors (581534439).
1305124101 is a wasteful number, since it uses less digits than its factorization.
1305124101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113796 (or 113793 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 1305124101 is about 36126.5013667252. The cubic root of 1305124101 is about 1092.8249537543.
Adding to 1305124101 its reverse (1014215031), we get a palindrome (2319339132).
The spelling of 1305124101 in words is "one billion, three hundred five million, one hundred twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •