Base | Representation |
---|---|
bin | 1010001101110011010100… |
… | …1001000000001000011001 |
3 | 1110202210100111022101210121 |
4 | 2203130311021000020121 |
5 | 2433012102121000241 |
6 | 35520003220313241 |
7 | 2236334104320556 |
oct | 243346511001031 |
9 | 43683314271717 |
10 | 11232231031321 |
11 | 3640620658a83 |
12 | 1314a6b542821 |
13 | 63626c0b31a1 |
14 | 2ab9000d9a2d |
15 | 147299553ad1 |
hex | a3735240219 |
11232231031321 has 8 divisors (see below), whose sum is σ = 11993160738240. Its totient is φ = 10494015644112.
The previous prime is 11232231031211. The next prime is 11232231031349. The reversal of 11232231031321 is 12313013223211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11232231031321 - 29 = 11232231030809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11232231035321) 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 in 7 ways as a sum of consecutive naturals, for example, 5678578906 + ... + 5678580883.
It is an arithmetic number, because the mean of its divisors is an integer number (1499145092280).
Almost surely, 211232231031321 is an apocalyptic number.
It is an amenable number.
11232231031321 is a deficient number, since it is larger than the sum of its proper divisors (760929706919).
11232231031321 is a wasteful number, since it uses less digits than its factorization.
11232231031321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11357159855.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 11232231031321 its reverse (12313013223211), we get a palindrome (23545244254532).
The spelling of 11232231031321 in words is "eleven trillion, two hundred thirty-two billion, two hundred thirty-one million, thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •