Base | Representation |
---|---|
bin | 101110101101100001… |
… | …1111011001010001101 |
3 | 100120220220201202012021 |
4 | 1131123003323022031 |
5 | 3120414333100323 |
6 | 114025510210141 |
7 | 10150552646602 |
oct | 1353303731215 |
9 | 316826652167 |
10 | 100312003213 |
11 | 395a65687a4 |
12 | 17536353951 |
13 | 95c8350b26 |
14 | 4bd867a6a9 |
15 | 292181a05d |
hex | 175b0fb28d |
100312003213 has 4 divisors (see below), whose sum is σ = 100312837468. Its totient is φ = 100311168960.
The previous prime is 100312003193. The next prime is 100312003291. The reversal of 100312003213 is 312300213001.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 30085943209 + 70226060004 = 173453^2 + 265002^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100312003213 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 (100312003013) 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, 198606 + ... + 489967.
It is an arithmetic number, because the mean of its divisors is an integer number (25078209367).
Almost surely, 2100312003213 is an apocalyptic number.
It is an amenable number.
100312003213 is a deficient number, since it is larger than the sum of its proper divisors (834255).
100312003213 is an equidigital number, since it uses as much as digits as its factorization.
100312003213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 834254.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 100312003213 its reverse (312300213001), we get a palindrome (412612216214).
The spelling of 100312003213 in words is "one hundred billion, three hundred twelve million, three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •