Base | Representation |
---|---|
bin | 1100011001011111001… |
… | …0101000110001011001 |
3 | 202100210100010200220221 |
4 | 3012113302220301121 |
5 | 11442211002000241 |
6 | 241503441520041 |
7 | 21250224251650 |
oct | 3062762506131 |
9 | 670710120827 |
10 | 213000031321 |
11 | 82372a68140 |
12 | 35345343021 |
13 | 171167021bc |
14 | a448858197 |
15 | 58198d05d1 |
hex | 3197ca8c59 |
213000031321 has 16 divisors (see below), whose sum is σ = 277104503808. Its totient is φ = 158757786000.
The previous prime is 213000031291. The next prime is 213000031333. The reversal of 213000031321 is 123130000312.
213000031321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 213000031321 - 27 = 213000031193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 213000031295 and 213000031304.
It is not an unprimeable number, because it can be changed into a prime (213000031021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 60133755 + ... + 60137296.
It is an arithmetic number, because the mean of its divisors is an integer number (17319031488).
Almost surely, 2213000031321 is an apocalyptic number.
It is an amenable number.
213000031321 is a deficient number, since it is larger than the sum of its proper divisors (64104472487).
213000031321 is a wasteful number, since it uses less digits than its factorization.
213000031321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120271092.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 213000031321 its reverse (123130000312), we get a palindrome (336130031633).
The spelling of 213000031321 in words is "two hundred thirteen billion, thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •