Base | Representation |
---|---|
bin | 1100011001111011110… |
… | …0101010111101001111 |
3 | 202101002201001221020101 |
4 | 3012132330222331033 |
5 | 11442432221232343 |
6 | 241523411231531 |
7 | 21253212656620 |
oct | 3063674527517 |
9 | 671081057211 |
10 | 213120102223 |
11 | 82424818196 |
12 | 353795a85a7 |
13 | 17135552482 |
14 | a45a791a47 |
15 | 58251ebe4d |
hex | 319ef2af4f |
213120102223 has 8 divisors (see below), whose sum is σ = 254155650048. Its totient is φ = 174732009144.
The previous prime is 213120102203. The next prime is 213120102263. The reversal of 213120102223 is 322201021312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 213120102223 - 217 = 213119971151 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 213120102223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213120102203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 661863511 + ... + 661863832.
It is an arithmetic number, because the mean of its divisors is an integer number (31769456256).
Almost surely, 2213120102223 is an apocalyptic number.
213120102223 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
213120102223 is a deficient number, since it is larger than the sum of its proper divisors (41035547825).
213120102223 is a wasteful number, since it uses less digits than its factorization.
213120102223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1323727373.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 213120102223 its reverse (322201021312), we get a palindrome (535321123535).
The spelling of 213120102223 in words is "two hundred thirteen billion, one hundred twenty million, one hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •