Base | Representation |
---|---|
bin | 1010000010001010100100… |
… | …0111011011010001000011 |
3 | 1110001200022212212000121201 |
4 | 2200202221013123101003 |
5 | 2421223134201443243 |
6 | 35244101430002031 |
7 | 2216026002620062 |
oct | 240425107332103 |
9 | 43050285760551 |
10 | 11032313312323 |
11 | 3573861286806 |
12 | 12a21774a6317 |
13 | 62045bb426c4 |
14 | 2a1d76d161d9 |
15 | 141e9843404d |
hex | a08a91db443 |
11032313312323 has 4 divisors (see below), whose sum is σ = 11032573238248. Its totient is φ = 11032053386400.
The previous prime is 11032313312243. The next prime is 11032313312329. The reversal of 11032313312323 is 32321331323011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11032313312323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11032313312291 and 11032313312300.
It is not an unprimeable number, because it can be changed into a prime (11032313312329) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 129899286 + ... + 129984187.
It is an arithmetic number, because the mean of its divisors is an integer number (2758143309562).
Almost surely, 211032313312323 is an apocalyptic number.
11032313312323 is a deficient number, since it is larger than the sum of its proper divisors (259925925).
11032313312323 is an equidigital number, since it uses as much as digits as its factorization.
11032313312323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259925924.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 11032313312323 its reverse (32321331323011), we get a palindrome (43353644635334).
The spelling of 11032313312323 in words is "eleven trillion, thirty-two billion, three hundred thirteen million, three hundred twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •