Base | Representation |
---|---|
bin | 1010010011000001110001… |
… | …1000111110110110111111 |
3 | 1111002101002100110210120002 |
4 | 2210300130120332312333 |
5 | 2440444434041300411 |
6 | 40025132025344515 |
7 | 2245662651664112 |
oct | 244603430766677 |
9 | 44071070423502 |
10 | 11322010103231 |
11 | 36757015a2573 |
12 | 132a34633813b |
13 | 641879201489 |
14 | 2b1db9928579 |
15 | 1497a12e033b |
hex | a4c1c63edbf |
11322010103231 has 2 divisors, whose sum is σ = 11322010103232. Its totient is φ = 11322010103230.
The previous prime is 11322010103227. The next prime is 11322010103303. The reversal of 11322010103231 is 13230101022311.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11322010103231 - 22 = 11322010103227 is a prime.
It is a super-2 number, since 2×113220101032312 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11322010103731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5661005051615 + 5661005051616.
It is an arithmetic number, because the mean of its divisors is an integer number (5661005051616).
Almost surely, 211322010103231 is an apocalyptic number.
11322010103231 is a deficient number, since it is larger than the sum of its proper divisors (1).
11322010103231 is an equidigital number, since it uses as much as digits as its factorization.
11322010103231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11322010103231 its reverse (13230101022311), we get a palindrome (24552111125542).
The spelling of 11322010103231 in words is "eleven trillion, three hundred twenty-two billion, ten million, one hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •