Base | Representation |
---|---|
bin | 1100001110110011001… |
… | …1000010000100111010 |
3 | 202002101101222112202110 |
4 | 3003230303002010322 |
5 | 11420322043343114 |
6 | 240311041313150 |
7 | 21116150664504 |
oct | 3035463020472 |
9 | 662341875673 |
10 | 210131231034 |
11 | 8113066900a |
12 | 348846357b6 |
13 | 16a7a26653a |
14 | a255844d74 |
15 | 56ecb05759 |
hex | 30eccc213a |
210131231034 has 8 divisors (see below), whose sum is σ = 420262462080. Its totient is φ = 70043743676.
The previous prime is 210131231021. The next prime is 210131231039. The reversal of 210131231034 is 430132131012.
It is a sphenic number, since it is the product of 3 distinct primes.
210131231034 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 210131231034.
It is not an unprimeable number, because it can be changed into a prime (210131231039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17510935914 + ... + 17510935925.
It is an arithmetic number, because the mean of its divisors is an integer number (52532807760).
Almost surely, 2210131231034 is an apocalyptic number.
210131231034 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210131231034 is a wasteful number, since it uses less digits than its factorization.
210131231034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35021871844.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 210131231034 its reverse (430132131012), we get a palindrome (640263362046).
The spelling of 210131231034 in words is "two hundred ten billion, one hundred thirty-one million, two hundred thirty-one thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •