Base | Representation |
---|---|
bin | 11101111110110000000… |
… | …01000001110011001101 |
3 | 10122110220221000121221212 |
4 | 32333120001001303031 |
5 | 113334142030110132 |
6 | 2105121535104205 |
7 | 134265236564156 |
oct | 16773001016315 |
9 | 3573827017855 |
10 | 1030121331917 |
11 | 367965700437 |
12 | 147789672065 |
13 | 761a8832b72 |
14 | 37c02a3692d |
15 | 1bbe0d5a5b2 |
hex | efd8041ccd |
1030121331917 has 2 divisors, whose sum is σ = 1030121331918. Its totient is φ = 1030121331916.
The previous prime is 1030121331901. The next prime is 1030121331929. The reversal of 1030121331917 is 7191331210301.
1030121331917 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., 951758287561 + 78363044356 = 975581^2 + 279934^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030121331917 - 24 = 1030121331901 is a prime.
It is a super-2 number, since 2×10301213319172 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030121331947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515060665958 + 515060665959.
It is an arithmetic number, because the mean of its divisors is an integer number (515060665959).
Almost surely, 21030121331917 is an apocalyptic number.
It is an amenable number.
1030121331917 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030121331917 is an equidigital number, since it uses as much as digits as its factorization.
1030121331917 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3402, while the sum is 32.
The spelling of 1030121331917 in words is "one trillion, thirty billion, one hundred twenty-one million, three hundred thirty-one thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •