Base | Representation |
---|---|
bin | 1001001101001000110010… |
… | …1000010011000001101111 |
3 | 1022211120211221221202001112 |
4 | 2103102030220103001233 |
5 | 2311311411343321221 |
6 | 33305355002502235 |
7 | 2063145210154544 |
oct | 223221450230157 |
9 | 38746757852045 |
10 | 10121302323311 |
11 | 32524693329a3 |
12 | 11756ab80497b |
13 | 5855860b21aa |
14 | 26dc333dcbcb |
15 | 1284293e715b |
hex | 9348ca1306f |
10121302323311 has 4 divisors (see below), whose sum is σ = 10179806961192. Its totient is φ = 10062797685432.
The previous prime is 10121302323299. The next prime is 10121302323329. The reversal of 10121302323311 is 11332320312101.
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 10121302323311 - 242 = 5723255812207 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 (10121302323331) 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, 29252318681 + ... + 29252319026.
It is an arithmetic number, because the mean of its divisors is an integer number (2544951740298).
Almost surely, 210121302323311 is an apocalyptic number.
10121302323311 is a deficient number, since it is larger than the sum of its proper divisors (58504637881).
10121302323311 is an equidigital number, since it uses as much as digits as its factorization.
10121302323311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58504637880.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 10121302323311 its reverse (11332320312101), we get a palindrome (21453622635412).
The spelling of 10121302323311 in words is "ten trillion, one hundred twenty-one billion, three hundred two million, three hundred twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •