Base | Representation |
---|---|
bin | 10100101111101011… |
… | …11001000000001111 |
3 | 1001202012000121212012 |
4 | 22113311321000033 |
5 | 140302134440302 |
6 | 5041053331435 |
7 | 542665343054 |
oct | 122765710017 |
9 | 31665017765 |
10 | 11137421327 |
11 | 47a586953a |
12 | 21a9a96b7b |
13 | 1086541046 |
14 | 77924302b |
15 | 452b86a52 |
hex | 297d7900f |
11137421327 has 16 divisors (see below), whose sum is σ = 11999988000. Its totient is φ = 10298127360.
The previous prime is 11137421303. The next prime is 11137421333. The reversal of 11137421327 is 72312473111.
It is a cyclic number.
It is not a de Polignac number, because 11137421327 - 212 = 11137417231 is a prime.
It is a super-2 number, since 2×111374213272 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11137421293 and 11137421302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11137421627) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2446049 + ... + 2450597.
It is an arithmetic number, because the mean of its divisors is an integer number (749999250).
Almost surely, 211137421327 is an apocalyptic number.
11137421327 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
11137421327 is a deficient number, since it is larger than the sum of its proper divisors (862566673).
11137421327 is a wasteful number, since it uses less digits than its factorization.
11137421327 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7066.
The product of its digits is 7056, while the sum is 32.
Adding to 11137421327 its reverse (72312473111), we get a palindrome (83449894438).
The spelling of 11137421327 in words is "eleven billion, one hundred thirty-seven million, four hundred twenty-one thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •