Base | Representation |
---|---|
bin | 10100100011010111… |
… | …10101011110010011 |
3 | 1001110222122111000001 |
4 | 22101223311132103 |
5 | 140044213402011 |
6 | 5022523310431 |
7 | 540302330164 |
oct | 122153653623 |
9 | 31428574001 |
10 | 11034122131 |
11 | 47525242aa |
12 | 217b37b417 |
13 | 106b013966 |
14 | 76963376b |
15 | 448a7e7c1 |
hex | 291af5793 |
11034122131 has 8 divisors (see below), whose sum is σ = 11082322944. Its totient is φ = 10985969160.
The previous prime is 11034122123. The next prime is 11034122147. The reversal of 11034122131 is 13122143011.
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 11034122131 - 23 = 11034122123 is a prime.
It is a super-2 number, since 2×110341221312 (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 = 11034122099 and 11034122108.
It is not an unprimeable number, because it can be changed into a prime (11034122191) 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 7 ways as a sum of consecutive naturals, for example, 496990 + ... + 518716.
It is an arithmetic number, because the mean of its divisors is an integer number (1385290368).
Almost surely, 211034122131 is an apocalyptic number.
11034122131 is a deficient number, since it is larger than the sum of its proper divisors (48200813).
11034122131 is a wasteful number, since it uses less digits than its factorization.
11034122131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23921.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 11034122131 its reverse (13122143011), we get a palindrome (24156265142).
The spelling of 11034122131 in words is "eleven billion, thirty-four million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •