Base | Representation |
---|---|
bin | 10011000011101001… |
… | …11110110010011101 |
3 | 222102000211111000201 |
4 | 21201310332302131 |
5 | 131423142310323 |
6 | 4411122223501 |
7 | 511352606644 |
oct | 114164766235 |
9 | 28360744021 |
10 | 10231213213 |
11 | 4380286a11 |
12 | 1b964b4b91 |
13 | c70882a20 |
14 | 6d0b4c35b |
15 | 3ed3308ad |
hex | 261d3ec9d |
10231213213 has 8 divisors (see below), whose sum is σ = 11274468128. Its totient is φ = 9224563824.
The previous prime is 10231213193. The next prime is 10231213217. The reversal of 10231213213 is 31231213201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10231213213 - 213 = 10231205021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10231213217) 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 7 ways as a sum of consecutive naturals, for example, 9150795 + ... + 9151912.
It is an arithmetic number, because the mean of its divisors is an integer number (1409308516).
Almost surely, 210231213213 is an apocalyptic number.
10231213213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10231213213 is a deficient number, since it is larger than the sum of its proper divisors (1043254915).
10231213213 is a wasteful number, since it uses less digits than its factorization.
10231213213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18302763.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10231213213 its reverse (31231213201), we get a palindrome (41462426414).
The spelling of 10231213213 in words is "ten billion, two hundred thirty-one million, two hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.196 sec. • engine limits •