Base | Representation |
---|---|
bin | 1100011010010110001… |
… | …1101110100111010001 |
3 | 202101101102202100000210 |
4 | 3012211203232213101 |
5 | 11443144114112423 |
6 | 241542412234333 |
7 | 21256030426011 |
oct | 3064543564721 |
9 | 671342670023 |
10 | 213231004113 |
11 | 82481385446 |
12 | 353aa76b9a9 |
13 | 171525121aa |
14 | a46b3bdc41 |
15 | 582ed06b93 |
hex | 31a58ee9d1 |
213231004113 has 8 divisors (see below), whose sum is σ = 299271584800. Its totient is φ = 134672213088.
The previous prime is 213231004099. The next prime is 213231004117. The reversal of 213231004113 is 311400132312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 213231004113 - 25 = 213231004081 is a prime.
It is a super-2 number, since 2×2132310041132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 213231004113.
It is not an unprimeable number, because it can be changed into a prime (213231004117) 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, 1870447348 + ... + 1870447461.
It is an arithmetic number, because the mean of its divisors is an integer number (37408948100).
Almost surely, 2213231004113 is an apocalyptic number.
It is an amenable number.
213231004113 is a deficient number, since it is larger than the sum of its proper divisors (86040580687).
213231004113 is a wasteful number, since it uses less digits than its factorization.
213231004113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3740894831.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 213231004113 its reverse (311400132312), we get a palindrome (524631136425).
The spelling of 213231004113 in words is "two hundred thirteen billion, two hundred thirty-one million, four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •