Base | Representation |
---|---|
bin | 1100010010011110111… |
… | …1010011110110011011 |
3 | 202011221022201212001111 |
4 | 3010213233103312123 |
5 | 11424333222023003 |
6 | 240553124401151 |
7 | 21152516222464 |
oct | 3044757236633 |
9 | 664838655044 |
10 | 211120111003 |
11 | 8159888718a |
12 | 34abb8461b7 |
13 | 16ba70ac109 |
14 | a30acd9d6b |
15 | 575983be6d |
hex | 3127bd3d9b |
211120111003 has 8 divisors (see below), whose sum is σ = 233258025888. Its totient is φ = 190062094464.
The previous prime is 211120110973. The next prime is 211120111009. The reversal of 211120111003 is 300111021112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211120111003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211120111009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 269974176 + ... + 269974957.
It is an arithmetic number, because the mean of its divisors is an integer number (29157253236).
Almost surely, 2211120111003 is an apocalyptic number.
211120111003 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
211120111003 is a deficient number, since it is larger than the sum of its proper divisors (22137914885).
211120111003 is a wasteful number, since it uses less digits than its factorization.
211120111003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539949173.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 211120111003 its reverse (300111021112), we get a palindrome (511231132115).
The spelling of 211120111003 in words is "two hundred eleven billion, one hundred twenty million, one hundred eleven thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •