Base | Representation |
---|---|
bin | 1100011010101011111… |
… | …1100111011110110101 |
3 | 202101121210100121122202 |
4 | 3012222333213132311 |
5 | 11443340440413023 |
6 | 241555431034245 |
7 | 21261215535125 |
oct | 3065277473665 |
9 | 671553317582 |
10 | 213322201013 |
11 | 82518903a89 |
12 | 3541520b985 |
13 | 17168392b5c |
14 | a47955cc85 |
15 | 5837d1d128 |
hex | 31aafe77b5 |
213322201013 has 4 divisors (see below), whose sum is σ = 220203562368. Its totient is φ = 206440839660.
The previous prime is 213322201003. The next prime is 213322201019. The reversal of 213322201013 is 310102223312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 213322201013 - 232 = 209027233717 is a prime.
It is a super-2 number, since 2×2133222010132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213322201019) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3440680631 + ... + 3440680692.
It is an arithmetic number, because the mean of its divisors is an integer number (55050890592).
Almost surely, 2213322201013 is an apocalyptic number.
It is an amenable number.
213322201013 is a deficient number, since it is larger than the sum of its proper divisors (6881361355).
213322201013 is an equidigital number, since it uses as much as digits as its factorization.
213322201013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6881361354.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 213322201013 its reverse (310102223312), we get a palindrome (523424424325).
The spelling of 213322201013 in words is "two hundred thirteen billion, three hundred twenty-two million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •