Base | Representation |
---|---|
bin | 11001000101000101010001… |
… | …011010011011001110001001 |
3 | 112110112121122222200100102202 |
4 | 121011011101122123032021 |
5 | 103424130230234312223 |
6 | 1030331151444405545 |
7 | 32142641154131432 |
oct | 3105052132331611 |
9 | 473477588610382 |
10 | 110300421010313 |
11 | 321661671527a6 |
12 | 10454b639a68b5 |
13 | 49713923b98a1 |
14 | 1d347d6d56489 |
15 | cb4278d35428 |
hex | 64515169b389 |
110300421010313 has 2 divisors, whose sum is σ = 110300421010314. Its totient is φ = 110300421010312.
The previous prime is 110300421010211. The next prime is 110300421010319. The reversal of 110300421010313 is 313010124003011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106316452914169 + 3983968096144 = 10310987^2 + 1995988^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110300421010313 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (110300421010319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55150210505156 + 55150210505157.
It is an arithmetic number, because the mean of its divisors is an integer number (55150210505157).
Almost surely, 2110300421010313 is an apocalyptic number.
It is an amenable number.
110300421010313 is a deficient number, since it is larger than the sum of its proper divisors (1).
110300421010313 is an equidigital number, since it uses as much as digits as its factorization.
110300421010313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 110300421010313 its reverse (313010124003011), we get a palindrome (423310545013324).
The spelling of 110300421010313 in words is "one hundred ten trillion, three hundred billion, four hundred twenty-one million, ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •