Base | Representation |
---|---|
bin | 101110001110011011111101… |
… | …011000010111011100101011 |
3 | 222122211111121011122010101012 |
4 | 232032123331120113130223 |
5 | 203121400433122341021 |
6 | 2000215431223214135 |
7 | 60552046566635330 |
oct | 5616337530273453 |
9 | 878744534563335 |
10 | 203302233012011 |
11 | 59861aa15032a1 |
12 | 1a9754025a734b |
13 | 895941a439c63 |
14 | 382bc48450987 |
15 | 187855703035b |
hex | b8e6fd61772b |
203302233012011 has 4 divisors (see below), whose sum is σ = 232345409156592. Its totient is φ = 174259056867432.
The previous prime is 203302233012007. The next prime is 203302233012089. The reversal of 203302233012011 is 110210332203302.
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 203302233012011 - 22 = 203302233012007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (203302233012311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14521588072280 + ... + 14521588072293.
It is an arithmetic number, because the mean of its divisors is an integer number (58086352289148).
Almost surely, 2203302233012011 is an apocalyptic number.
203302233012011 is a deficient number, since it is larger than the sum of its proper divisors (29043176144581).
203302233012011 is an equidigital number, since it uses as much as digits as its factorization.
203302233012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29043176144580.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 203302233012011 its reverse (110210332203302), we get a palindrome (313512565215313).
The spelling of 203302233012011 in words is "two hundred three trillion, three hundred two billion, two hundred thirty-three million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.228 sec. • engine limits •