Base | Representation |
---|---|
bin | 101010000011011… |
… | …1101110110100101 |
3 | 10122100020221020122 |
4 | 1110012331312211 |
5 | 10342221043412 |
6 | 352005011325 |
7 | 46653154124 |
oct | 12406756645 |
9 | 3570227218 |
10 | 1411112357 |
11 | 664599666 |
12 | 3346b3b45 |
13 | 19646c735 |
14 | d55a5abb |
15 | 83d3c572 |
hex | 541bdda5 |
1411112357 has 4 divisors (see below), whose sum is σ = 1411411200. Its totient is φ = 1410813516.
The previous prime is 1411112341. The next prime is 1411112369. The reversal of 1411112357 is 7532111141.
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 1411112357 - 24 = 1411112341 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 (1411112317) 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, 142223 + ... + 151820.
It is an arithmetic number, because the mean of its divisors is an integer number (352852800).
Almost surely, 21411112357 is an apocalyptic number.
It is an amenable number.
1411112357 is a deficient number, since it is larger than the sum of its proper divisors (298843).
1411112357 is an equidigital number, since it uses as much as digits as its factorization.
1411112357 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298842.
The product of its digits is 840, while the sum is 26.
The square root of 1411112357 is about 37564.7754818261. The cubic root of 1411112357 is about 1121.6409717296.
Adding to 1411112357 its reverse (7532111141), we get a palindrome (8943223498).
The spelling of 1411112357 in words is "one billion, four hundred eleven million, one hundred twelve thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •