Base | Representation |
---|---|
bin | 10100111000011110… |
… | …10111110111110111 |
3 | 1001221022212111012120 |
4 | 22130033113313313 |
5 | 140430032211411 |
6 | 5052251051023 |
7 | 544552500054 |
oct | 123417276767 |
9 | 31838774176 |
10 | 11211210231 |
11 | 4833488201 |
12 | 220a740a73 |
13 | 1098908310 |
14 | 784d7002b |
15 | 4593b0106 |
hex | 29c3d7df7 |
11211210231 has 8 divisors (see below), whose sum is σ = 16098148080. Its totient is φ = 6899206272.
The previous prime is 11211210209. The next prime is 11211210259. The reversal of 11211210231 is 13201211211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11211210231 - 221 = 11209113079 is a prime.
It is a super-2 number, since 2×112112102312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11211210231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11211210931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 143733426 + ... + 143733503.
It is an arithmetic number, because the mean of its divisors is an integer number (2012268510).
Almost surely, 211211210231 is an apocalyptic number.
11211210231 is a deficient number, since it is larger than the sum of its proper divisors (4886937849).
11211210231 is a wasteful number, since it uses less digits than its factorization.
11211210231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287466945.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 11211210231 its reverse (13201211211), we get a palindrome (24412421442).
The spelling of 11211210231 in words is "eleven billion, two hundred eleven million, two hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •