Base | Representation |
---|---|
bin | 11101011001101100110… |
… | …10110001101001000101 |
3 | 10120120120200112200100022 |
4 | 32230312122301221011 |
5 | 113022422424201201 |
6 | 2052032101224525 |
7 | 132662306616122 |
oct | 16546632615105 |
9 | 3516520480308 |
10 | 1010230303301 |
11 | 35a48874020a |
12 | 143958102145 |
13 | 743588c034b |
14 | 36c76dd9749 |
15 | 1b42996741b |
hex | eb366b1a45 |
1010230303301 has 2 divisors, whose sum is σ = 1010230303302. Its totient is φ = 1010230303300.
The previous prime is 1010230303273. The next prime is 1010230303309. The reversal of 1010230303301 is 1033030320101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 941581063201 + 68649240100 = 970351^2 + 262010^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010230303301 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1010230303301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010230303309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505115151650 + 505115151651.
It is an arithmetic number, because the mean of its divisors is an integer number (505115151651).
Almost surely, 21010230303301 is an apocalyptic number.
It is an amenable number.
1010230303301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010230303301 is an equidigital number, since it uses as much as digits as its factorization.
1010230303301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 1010230303301 its reverse (1033030320101), we get a palindrome (2043260623402).
The spelling of 1010230303301 in words is "one trillion, ten billion, two hundred thirty million, three hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •