Base | Representation |
---|---|
bin | 10111000010001000001100… |
… | …101110110001010000001011 |
3 | 111021200022101121212012020012 |
4 | 113002020030232301100023 |
5 | 101234210041412333121 |
6 | 555241102544022135 |
7 | 30223530644453366 |
oct | 2702101456612013 |
9 | 437608347765205 |
10 | 101301312230411 |
11 | 2a30671091a507 |
12 | b440a5860194b |
13 | 446a89906b187 |
14 | 1b0301c7830dd |
15 | baa12d9edc5b |
hex | 5c220cbb140b |
101301312230411 has 4 divisors (see below), whose sum is σ = 101301349370832. Its totient is φ = 101301275089992.
The previous prime is 101301312230389. The next prime is 101301312230431. The reversal of 101301312230411 is 114032213103101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101301312230411 - 226 = 101301245121547 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101301312230431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14124095 + ... + 20052248.
It is an arithmetic number, because the mean of its divisors is an integer number (25325337342708).
Almost surely, 2101301312230411 is an apocalyptic number.
101301312230411 is a deficient number, since it is larger than the sum of its proper divisors (37140421).
101301312230411 is an equidigital number, since it uses as much as digits as its factorization.
101301312230411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37140420.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 101301312230411 its reverse (114032213103101), we get a palindrome (215333525333512).
The spelling of 101301312230411 in words is "one hundred one trillion, three hundred one billion, three hundred twelve million, two hundred thirty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •