Base | Representation |
---|---|
bin | 11101011001100000111… |
… | …01010011100011000101 |
3 | 10120120022201101010221212 |
4 | 32230300131103203011 |
5 | 113022221324200143 |
6 | 2052014130021205 |
7 | 132656653623425 |
oct | 16546035234305 |
9 | 3516281333855 |
10 | 1010130303173 |
11 | 35a437249682 |
12 | 14392a717805 |
13 | 74340c79784 |
14 | 36c67a08485 |
15 | 1b420cb2918 |
hex | eb307538c5 |
1010130303173 has 2 divisors, whose sum is σ = 1010130303174. Its totient is φ = 1010130303172.
The previous prime is 1010130303109. The next prime is 1010130303191. The reversal of 1010130303173 is 3713030310101.
1010130303173 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1004290592449 + 5839710724 = 1002143^2 + 76418^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010130303173 - 26 = 1010130303109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010130303103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505065151586 + 505065151587.
It is an arithmetic number, because the mean of its divisors is an integer number (505065151587).
Almost surely, 21010130303173 is an apocalyptic number.
It is an amenable number.
1010130303173 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010130303173 is an equidigital number, since it uses as much as digits as its factorization.
1010130303173 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 567, while the sum is 23.
Adding to 1010130303173 its reverse (3713030310101), we get a palindrome (4723160613274).
The spelling of 1010130303173 in words is "one trillion, ten billion, one hundred thirty million, three hundred three thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •