Base | Representation |
---|---|
bin | 10100111101111111… |
… | …00101110100101001 |
3 | 1002001112210102010022 |
4 | 22132333211310221 |
5 | 141023343422323 |
6 | 5101021130225 |
7 | 545653234622 |
oct | 123677456451 |
9 | 32045712108 |
10 | 11257404713 |
11 | 4857569865 |
12 | 22220b9975 |
13 | 10a5360529 |
14 | 78b156a49 |
15 | 45d4874c8 |
hex | 29efe5d29 |
11257404713 has 8 divisors (see below), whose sum is σ = 11286488136. Its totient is φ = 11228342400.
The previous prime is 11257404707. The next prime is 11257404737. The reversal of 11257404713 is 31740475211.
It can be written as a sum of positive squares in 4 ways, for example, as 796819984 + 10460584729 = 28228^2 + 102277^2 .
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 11257404713 - 212 = 11257400617 is a prime.
It is a super-2 number, since 2×112574047132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11257404793) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1850645 + ... + 1856717.
It is an arithmetic number, because the mean of its divisors is an integer number (1410811017).
Almost surely, 211257404713 is an apocalyptic number.
It is an amenable number.
11257404713 is a deficient number, since it is larger than the sum of its proper divisors (29083423).
11257404713 is an equidigital number, since it uses as much as digits as its factorization.
11257404713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10555.
The product of its (nonzero) digits is 23520, while the sum is 35.
Adding to 11257404713 its reverse (31740475211), we get a palindrome (42997879924).
The spelling of 11257404713 in words is "eleven billion, two hundred fifty-seven million, four hundred four thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •