Base | Representation |
---|---|
bin | 101110101101110011… |
… | …1011001011100100111 |
3 | 100120221120020012011022 |
4 | 1131123213121130213 |
5 | 3120424223133221 |
6 | 114030441401355 |
7 | 10151024666636 |
oct | 1353347313447 |
9 | 316846205138 |
10 | 100321302311 |
11 | 3960083a2aa |
12 | 1753949925b |
13 | 95ca258659 |
14 | 4bd99bb51d |
15 | 29225554ab |
hex | 175b9d9727 |
100321302311 has 4 divisors (see below), whose sum is σ = 100322565672. Its totient is φ = 100320038952.
The previous prime is 100321302251. The next prime is 100321302329. The reversal of 100321302311 is 113203123001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100321302311 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100321302311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100321307311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 503960 + ... + 674253.
It is an arithmetic number, because the mean of its divisors is an integer number (25080641418).
Almost surely, 2100321302311 is an apocalyptic number.
100321302311 is a deficient number, since it is larger than the sum of its proper divisors (1263361).
100321302311 is an equidigital number, since it uses as much as digits as its factorization.
100321302311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1263360.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 100321302311 its reverse (113203123001), we get a palindrome (213524425312).
The spelling of 100321302311 in words is "one hundred billion, three hundred twenty-one million, three hundred two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •