Base | Representation |
---|---|
bin | 10100111000010110… |
… | …01110011110000101 |
3 | 1001221020211020222222 |
4 | 22130023032132011 |
5 | 140424242420031 |
6 | 5052211502125 |
7 | 544540321520 |
oct | 123413163605 |
9 | 31836736888 |
10 | 11210123141 |
11 | 4832905488 |
12 | 220a2b7945 |
13 | 1098617579 |
14 | 784b69bb7 |
15 | 459247e7b |
hex | 29c2ce785 |
11210123141 has 8 divisors (see below), whose sum is σ = 12935954304. Its totient is φ = 9515388240.
The previous prime is 11210123107. The next prime is 11210123161. The reversal of 11210123141 is 14132101211.
11210123141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11210123141 - 218 = 11209860997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11210123161) 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 7 ways as a sum of consecutive naturals, for example, 7773290 + ... + 7774731.
It is an arithmetic number, because the mean of its divisors is an integer number (1616994288).
Almost surely, 211210123141 is an apocalyptic number.
It is an amenable number.
11210123141 is a deficient number, since it is larger than the sum of its proper divisors (1725831163).
11210123141 is a wasteful number, since it uses less digits than its factorization.
11210123141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15548131.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11210123141 its reverse (14132101211), we get a palindrome (25342224352).
The spelling of 11210123141 in words is "eleven billion, two hundred ten million, one hundred twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •