Base | Representation |
---|---|
bin | 110011010111010000… |
… | …1001101000000011101 |
3 | 101112201010220100212021 |
4 | 1212232201031000131 |
5 | 3301344320401023 |
6 | 122401101140141 |
7 | 10653250365436 |
oct | 1465641150035 |
9 | 345633810767 |
10 | 110302122013 |
11 | 42862743926 |
12 | 19463b5a651 |
13 | a52ac8b825 |
14 | 54a538a48d |
15 | 2d088c535d |
hex | 19ae84d01d |
110302122013 has 2 divisors, whose sum is σ = 110302122014. Its totient is φ = 110302122012.
The previous prime is 110302121953. The next prime is 110302122041. The reversal of 110302122013 is 310221203011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 64586123044 + 45715998969 = 254138^2 + 213813^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110302122013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110302122113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55151061006 + 55151061007.
It is an arithmetic number, because the mean of its divisors is an integer number (55151061007).
Almost surely, 2110302122013 is an apocalyptic number.
It is an amenable number.
110302122013 is a deficient number, since it is larger than the sum of its proper divisors (1).
110302122013 is an equidigital number, since it uses as much as digits as its factorization.
110302122013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 110302122013 its reverse (310221203011), we get a palindrome (420523325024).
The spelling of 110302122013 in words is "one hundred ten billion, three hundred two million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •