Base | Representation |
---|---|
bin | 10110110011110110011001… |
… | …001100011011000100000101 |
3 | 111011012111202202000200010102 |
4 | 112303312121030123010011 |
5 | 101122121102023201201 |
6 | 553210232201133445 |
7 | 30062614061261504 |
oct | 2663663114330405 |
9 | 434174682020112 |
10 | 100320121303301 |
11 | 29a68585154459 |
12 | b30286578a285 |
13 | 43c91ba811683 |
14 | 1aab73c3b483b |
15 | b8e8536ab26b |
hex | 5b3d9931b105 |
100320121303301 has 16 divisors (see below), whose sum is σ = 102548837825280. Its totient is φ = 98109119895360.
The previous prime is 100320121303279. The next prime is 100320121303331. The reversal of 100320121303301 is 103303121023001.
It is a cyclic number.
It is not a de Polignac number, because 100320121303301 - 210 = 100320121302277 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 (100320121303331) 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 15 ways as a sum of consecutive naturals, for example, 114293435 + ... + 115167831.
It is an arithmetic number, because the mean of its divisors is an integer number (6409302364080).
Almost surely, 2100320121303301 is an apocalyptic number.
It is an amenable number.
100320121303301 is a deficient number, since it is larger than the sum of its proper divisors (2228716521979).
100320121303301 is an equidigital number, since it uses as much as digits as its factorization.
100320121303301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 884524.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 100320121303301 its reverse (103303121023001), we get a palindrome (203623242326302).
The spelling of 100320121303301 in words is "one hundred trillion, three hundred twenty billion, one hundred twenty-one million, three hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •