Base | Representation |
---|---|
bin | 1100011001011111011… |
… | …1100110000110101111 |
3 | 202100210102120201220121 |
4 | 3012113313212012233 |
5 | 11442211320043434 |
6 | 241503525425411 |
7 | 21250241304313 |
oct | 3062767460657 |
9 | 670712521817 |
10 | 213001331119 |
11 | 82373775755 |
12 | 3534586b267 |
13 | 17116a68a05 |
14 | a448ab5b43 |
15 | 5819a8a7b4 |
hex | 3197de61af |
213001331119 has 4 divisors (see below), whose sum is σ = 213003589120. Its totient is φ = 212999073120.
The previous prime is 213001331041. The next prime is 213001331129. The reversal of 213001331119 is 911133100312.
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 213001331119 - 211 = 213001329071 is a prime.
It is a super-2 number, since 2×2130013311192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 213001331093 and 213001331102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213001331129) 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 3 ways as a sum of consecutive naturals, for example, 981039 + ... + 1178320.
It is an arithmetic number, because the mean of its divisors is an integer number (53250897280).
Almost surely, 2213001331119 is an apocalyptic number.
213001331119 is a deficient number, since it is larger than the sum of its proper divisors (2258001).
213001331119 is an equidigital number, since it uses as much as digits as its factorization.
213001331119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2258000.
The product of its (nonzero) digits is 486, while the sum is 25.
The spelling of 213001331119 in words is "two hundred thirteen billion, one million, three hundred thirty-one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •