Base | Representation |
---|---|
bin | 10101011010111101… |
… | …01000110000010101 |
3 | 1002200111002002012112 |
4 | 22231132220300111 |
5 | 142023102033323 |
6 | 5141102000405 |
7 | 554663664365 |
oct | 125536506025 |
9 | 32614062175 |
10 | 11500424213 |
11 | 4971764a23 |
12 | 228b576105 |
13 | 11137ca855 |
14 | 7b15369a5 |
15 | 47498d178 |
hex | 2ad7a8c15 |
11500424213 has 2 divisors, whose sum is σ = 11500424214. Its totient is φ = 11500424212.
The previous prime is 11500424203. The next prime is 11500424267. The reversal of 11500424213 is 31242400511.
11500424213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9634011409 + 1866412804 = 98153^2 + 43202^2 .
It is a cyclic number.
It is not a de Polignac number, because 11500424213 - 216 = 11500358677 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11500424203) 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 as a sum of consecutive naturals, namely, 5750212106 + 5750212107.
It is an arithmetic number, because the mean of its divisors is an integer number (5750212107).
Almost surely, 211500424213 is an apocalyptic number.
It is an amenable number.
11500424213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11500424213 is an equidigital number, since it uses as much as digits as its factorization.
11500424213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 11500424213 its reverse (31242400511), we get a palindrome (42742824724).
The spelling of 11500424213 in words is "eleven billion, five hundred million, four hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •