Base | Representation |
---|---|
bin | 1010001101101111100011… |
… | …1100000111011010100011 |
3 | 1110202200202002210112011212 |
4 | 2203123320330013122203 |
5 | 2433003020040122243 |
6 | 35515315100300335 |
7 | 2236300061343233 |
oct | 243337074073243 |
9 | 43680662715155 |
10 | 11231221020323 |
11 | 3640152517847 |
12 | 13148292416ab |
13 | 63613aa7c445 |
14 | 2ab845d03cc3 |
15 | 14723aa46318 |
hex | a36f8f076a3 |
11231221020323 has 4 divisors (see below), whose sum is σ = 11891881080360. Its totient is φ = 10570560960288.
The previous prime is 11231221020301. The next prime is 11231221020337. The reversal of 11231221020323 is 32302012213211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11231221020323 - 218 = 11231220758179 is a prime.
It is a super-2 number, since 2×112312210203232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11231221020353) 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, 330330029993 + ... + 330330030026.
It is an arithmetic number, because the mean of its divisors is an integer number (2972970270090).
Almost surely, 211231221020323 is an apocalyptic number.
11231221020323 is a deficient number, since it is larger than the sum of its proper divisors (660660060037).
11231221020323 is an equidigital number, since it uses as much as digits as its factorization.
11231221020323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 660660060036.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 11231221020323 its reverse (32302012213211), we get a palindrome (43533233233534).
The spelling of 11231221020323 in words is "eleven trillion, two hundred thirty-one billion, two hundred twenty-one million, twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •