Base | Representation |
---|---|
bin | 1010000010001010100001… |
… | …1001001110001101011111 |
3 | 1110001200022001001122221102 |
4 | 2200202220121032031133 |
5 | 2421223123101401343 |
6 | 35244100314223315 |
7 | 2216025464642612 |
oct | 240425031161537 |
9 | 43050261048842 |
10 | 11032301200223 |
11 | 3573855463806 |
12 | 12a2173424b3b |
13 | 620459491694 |
14 | 2a1d75482179 |
15 | 141e973403b8 |
hex | a08a864e35f |
11032301200223 has 4 divisors (see below), whose sum is σ = 11040652678608. Its totient is φ = 11023949721840.
The previous prime is 11032301200189. The next prime is 11032301200231. The reversal of 11032301200223 is 32200210323011.
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 11032301200223 - 28 = 11032301199967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11032301200195 and 11032301200204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11032301200523) 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, 4175737211 + ... + 4175739852.
It is an arithmetic number, because the mean of its divisors is an integer number (2760163169652).
Almost surely, 211032301200223 is an apocalyptic number.
11032301200223 is a deficient number, since it is larger than the sum of its proper divisors (8351478385).
11032301200223 is an equidigital number, since it uses as much as digits as its factorization.
11032301200223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8351478384.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 11032301200223 its reverse (32200210323011), we get a palindrome (43232511523234).
The spelling of 11032301200223 in words is "eleven trillion, thirty-two billion, three hundred one million, two hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •