Base | Representation |
---|---|
bin | 10100111000101100… |
… | …10101100010001111 |
3 | 1001221110022020020011 |
4 | 22130112111202033 |
5 | 140431014120123 |
6 | 5052354134051 |
7 | 544604142034 |
oct | 123426254217 |
9 | 31843266204 |
10 | 11213035663 |
11 | 4834514725 |
12 | 220b281327 |
13 | 10990c715b |
14 | 7852c738b |
15 | 459620e0d |
hex | 29c59588f |
11213035663 has 4 divisors (see below), whose sum is σ = 11271742848. Its totient is φ = 11154328480.
The previous prime is 11213035643. The next prime is 11213035681. The reversal of 11213035663 is 36653031211.
11213035663 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11213035663 - 213 = 11213027471 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11213035643) 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 3 ways as a sum of consecutive naturals, for example, 29353306 + ... + 29353687.
It is an arithmetic number, because the mean of its divisors is an integer number (2817935712).
Almost surely, 211213035663 is an apocalyptic number.
11213035663 is a deficient number, since it is larger than the sum of its proper divisors (58707185).
11213035663 is an equidigital number, since it uses as much as digits as its factorization.
11213035663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58707184.
The product of its (nonzero) digits is 9720, while the sum is 31.
Adding to 11213035663 its reverse (36653031211), we get a palindrome (47866066874).
The spelling of 11213035663 in words is "eleven billion, two hundred thirteen million, thirty-five thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •