Base | Representation |
---|---|
bin | 10101010000001100… |
… | …10000001101010011 |
3 | 1002110012012110221212 |
4 | 22220012100031103 |
5 | 141331444134011 |
6 | 5124115010335 |
7 | 552516433106 |
oct | 125006201523 |
9 | 32405173855 |
10 | 11410146131 |
11 | 492580373a |
12 | 22652999ab |
13 | 10cabac177 |
14 | 7a355673d |
15 | 46baa908b |
hex | 2a8190353 |
11410146131 has 4 divisors (see below), whose sum is σ = 11414228352. Its totient is φ = 11406063912.
The previous prime is 11410146101. The next prime is 11410146151. The reversal of 11410146131 is 13164101411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11410146131 - 26 = 11410146067 is a prime.
It is a super-2 number, since 2×114101461312 (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 = 11410146097 and 11410146106.
It is not an unprimeable number, because it can be changed into a prime (11410146101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2036915 + ... + 2042508.
It is an arithmetic number, because the mean of its divisors is an integer number (2853557088).
Almost surely, 211410146131 is an apocalyptic number.
11410146131 is a deficient number, since it is larger than the sum of its proper divisors (4082221).
11410146131 is an equidigital number, since it uses as much as digits as its factorization.
11410146131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4082220.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 11410146131 its reverse (13164101411), we get a palindrome (24574247542).
The spelling of 11410146131 in words is "eleven billion, four hundred ten million, one hundred forty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •