Base | Representation |
---|---|
bin | 10110101111001111010101… |
… | …001011100001010111000001 |
3 | 111010002012222221001222212102 |
4 | 112233033111023201113001 |
5 | 101101423224312320001 |
6 | 552404514251440145 |
7 | 30031000000534325 |
oct | 2657172513412701 |
9 | 433065887058772 |
10 | 100003300120001 |
11 | 29956185923183 |
12 | b271386a56055 |
13 | 43a5369a6aa85 |
14 | 1a9a28521d985 |
15 | b864ae397e6b |
hex | 5af3d52e15c1 |
100003300120001 has 4 divisors (see below), whose sum is σ = 100005604440000. Its totient is φ = 100000995800004.
The previous prime is 100003300119991. The next prime is 100003300120027. The reversal of 100003300120001 is 100021003300001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 100003300120001 - 26 = 100003300119937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100003300140001) 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, 1152094901 + ... + 1152181698.
It is an arithmetic number, because the mean of its divisors is an integer number (25001401110000).
Almost surely, 2100003300120001 is an apocalyptic number.
It is an amenable number.
100003300120001 is a deficient number, since it is larger than the sum of its proper divisors (2304319999).
100003300120001 is an equidigital number, since it uses as much as digits as its factorization.
100003300120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2304319998.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 100003300120001 its reverse (100021003300001), we get a palindrome (200024303420002).
The spelling of 100003300120001 in words is "one hundred trillion, three billion, three hundred million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •