Base | Representation |
---|---|
bin | 100110111001010… |
… | …1011100001011101 |
3 | 10100221211112021221 |
4 | 1031302223201131 |
5 | 10133103143401 |
6 | 333301253341 |
7 | 44225300641 |
oct | 11562534135 |
9 | 3327745257 |
10 | 1305131101 |
11 | 60a79234a |
12 | 305104251 |
13 | 17a513631 |
14 | c5498c21 |
15 | 798a57a1 |
hex | 4dcab85d |
1305131101 has 4 divisors (see below), whose sum is σ = 1305467712. Its totient is φ = 1304794492.
The previous prime is 1305131083. The next prime is 1305131111. The reversal of 1305131101 is 1011315031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1305131101 - 27 = 1305130973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1305131111) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 162421 + ... + 170266.
It is an arithmetic number, because the mean of its divisors is an integer number (326366928).
Almost surely, 21305131101 is an apocalyptic number.
It is an amenable number.
1305131101 is a deficient number, since it is larger than the sum of its proper divisors (336611).
1305131101 is an equidigital number, since it uses as much as digits as its factorization.
1305131101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336610.
The product of its (nonzero) digits is 45, while the sum is 16.
The square root of 1305131101 is about 36126.5982483820. The cubic root of 1305131101 is about 1092.8269075305.
Adding to 1305131101 its reverse (1011315031), we get a palindrome (2316446132).
The spelling of 1305131101 in words is "one billion, three hundred five million, one hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •