Base | Representation |
---|---|
bin | 1010001101110110100110… |
… | …0111010110011010001011 |
3 | 1110202212121211212212111121 |
4 | 2203131221213112122023 |
5 | 2433020403004331443 |
6 | 35520230425540111 |
7 | 2236364654333362 |
oct | 243355147263213 |
9 | 43685554785447 |
10 | 11233111402123 |
11 | 3640a325a3656 |
12 | 1315076344637 |
13 | 63637c5c6160 |
14 | 2ab984dc67d9 |
15 | 1472eb9a44ed |
hex | a37699d668b |
11233111402123 has 4 divisors (see below), whose sum is σ = 12097196894608. Its totient is φ = 10369025909640.
The previous prime is 11233111402043. The next prime is 11233111402147. The reversal of 11233111402123 is 32120411133211.
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-11233111402123 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11233111402223) 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, 432042746223 + ... + 432042746248.
It is an arithmetic number, because the mean of its divisors is an integer number (3024299223652).
Almost surely, 211233111402123 is an apocalyptic number.
11233111402123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11233111402123 is a deficient number, since it is larger than the sum of its proper divisors (864085492485).
11233111402123 is an equidigital number, since it uses as much as digits as its factorization.
11233111402123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 864085492484.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 11233111402123 its reverse (32120411133211), we get a palindrome (43353522535334).
The spelling of 11233111402123 in words is "eleven trillion, two hundred thirty-three billion, one hundred eleven million, four hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •