Base | Representation |
---|---|
bin | 101000100100101… |
… | …1101010111111111 |
3 | 10111212210000111121 |
4 | 1101021131113333 |
5 | 10242011342421 |
6 | 343032131411 |
7 | 45510666442 |
oct | 12111352777 |
9 | 3455700447 |
10 | 1361434111 |
11 | 639548664 |
12 | 31bb36b67 |
13 | 18909791b |
14 | ccb53659 |
15 | 7e7c7d41 |
hex | 5125d5ff |
1361434111 has 4 divisors (see below), whose sum is σ = 1361521224. Its totient is φ = 1361347000.
The previous prime is 1361434093. The next prime is 1361434141. The reversal of 1361434111 is 1114341631.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1361434111 - 25 = 1361434079 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 (1361434141) 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 3 ways as a sum of consecutive naturals, for example, 12940 + ... + 53761.
It is an arithmetic number, because the mean of its divisors is an integer number (340380306).
Almost surely, 21361434111 is an apocalyptic number.
1361434111 is a deficient number, since it is larger than the sum of its proper divisors (87113).
1361434111 is an equidigital number, since it uses as much as digits as its factorization.
1361434111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87112.
The product of its digits is 864, while the sum is 25.
The square root of 1361434111 is about 36897.6166032442. The cubic root of 1361434111 is about 1108.3209500768.
Adding to 1361434111 its reverse (1114341631), we get a palindrome (2475775742).
The spelling of 1361434111 in words is "one billion, three hundred sixty-one million, four hundred thirty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •