Base | Representation |
---|---|
bin | 10100111000011111… |
… | …10011000010111011 |
3 | 1001221100002010212210 |
4 | 22130033303002323 |
5 | 140430044242111 |
6 | 5052253310203 |
7 | 544553442414 |
oct | 123417630273 |
9 | 31840063783 |
10 | 11211321531 |
11 | 4833553893 |
12 | 220a795363 |
13 | 1098946b87 |
14 | 784d9c80b |
15 | 4593d30a6 |
hex | 29c3f30bb |
11211321531 has 8 divisors (see below), whose sum is σ = 15153202000. Its totient is φ = 7371827712.
The previous prime is 11211321467. The next prime is 11211321553. The reversal of 11211321531 is 13512311211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11211321531 - 26 = 11211321467 is a prime.
It is a super-2 number, since 2×112113215312 (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 = 11211321498 and 11211321507.
It is not an unprimeable number, because it can be changed into a prime (11211321131) 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, 25596406 + ... + 25596843.
It is an arithmetic number, because the mean of its divisors is an integer number (1894150250).
Almost surely, 211211321531 is an apocalyptic number.
11211321531 is a deficient number, since it is larger than the sum of its proper divisors (3941880469).
11211321531 is an equidigital number, since it uses as much as digits as its factorization.
11211321531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51193325.
The product of its digits is 180, while the sum is 21.
Adding to 11211321531 its reverse (13512311211), we get a palindrome (24723632742).
The spelling of 11211321531 in words is "eleven billion, two hundred eleven million, three hundred twenty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •