Base | Representation |
---|---|
bin | 11101111110110010011… |
… | …01101101100001010101 |
3 | 10122110222022211220202021 |
4 | 32333121031231201111 |
5 | 113334212201341231 |
6 | 2105123534013141 |
7 | 134265602466514 |
oct | 16773115554125 |
9 | 3573868756667 |
10 | 1030141433941 |
11 | 367975a90384 |
12 | 1477943471b1 |
13 | 761aca50859 |
14 | 37c0558a67b |
15 | 1bbe29cb811 |
hex | efd936d855 |
1030141433941 has 2 divisors, whose sum is σ = 1030141433942. Its totient is φ = 1030141433940.
The previous prime is 1030141433939. The next prime is 1030141434013. The reversal of 1030141433941 is 1493341410301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 581362025841 + 448779408100 = 762471^2 + 669910^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030141433941 - 21 = 1030141433939 is a prime.
It is a super-2 number, since 2×10301414339412 (a number of 25 digits) contains 22 as substring.
Together with 1030141433939, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1030141433897 and 1030141433906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030141433921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515070716970 + 515070716971.
It is an arithmetic number, because the mean of its divisors is an integer number (515070716971).
Almost surely, 21030141433941 is an apocalyptic number.
It is an amenable number.
1030141433941 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030141433941 is an equidigital number, since it uses as much as digits as its factorization.
1030141433941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15552, while the sum is 34.
The spelling of 1030141433941 in words is "one trillion, thirty billion, one hundred forty-one million, four hundred thirty-three thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •