Base | Representation |
---|---|
bin | 10111000010000110111111… |
… | …001000011000010001101001 |
3 | 111021200012000220002100021011 |
4 | 113002012333020120101221 |
5 | 101234144410120233001 |
6 | 555240325435343521 |
7 | 30223453455431212 |
oct | 2702067710302151 |
9 | 437605026070234 |
10 | 101300010321001 |
11 | 2a306102a38718 |
12 | b4407545b1ba1 |
13 | 446a71c41508b |
14 | 1b02d378c6409 |
15 | baa0a4582d51 |
hex | 5c21bf218469 |
101300010321001 has 4 divisors (see below), whose sum is σ = 106631589811600. Its totient is φ = 95968430830404.
The previous prime is 101300010320981. The next prime is 101300010321007. The reversal of 101300010321001 is 100123010003101.
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 101300010321001 - 25 = 101300010320969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101300010321007) 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, 2665789745271 + ... + 2665789745308.
It is an arithmetic number, because the mean of its divisors is an integer number (26657897452900).
Almost surely, 2101300010321001 is an apocalyptic number.
It is an amenable number.
101300010321001 is a deficient number, since it is larger than the sum of its proper divisors (5331579490599).
101300010321001 is an equidigital number, since it uses as much as digits as its factorization.
101300010321001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5331579490598.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 101300010321001 its reverse (100123010003101), we get a palindrome (201423020324102).
The spelling of 101300010321001 in words is "one hundred one trillion, three hundred billion, ten million, three hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •