Base | Representation |
---|---|
bin | 11110010101000100010… |
… | …11111101100001110111 |
3 | 10200121211221220001021210 |
4 | 33022202023331201313 |
5 | 114033211400131411 |
6 | 2114422514412503 |
7 | 135201200311602 |
oct | 17124213754167 |
9 | 3617757801253 |
10 | 1042103130231 |
11 | 371a5405a899 |
12 | 149b72291133 |
13 | 77367c93957 |
14 | 3861c077339 |
15 | 1c192bd2ca6 |
hex | f2a22fd877 |
1042103130231 has 16 divisors (see below), whose sum is σ = 1422342345600. Its totient is φ = 678312354720.
The previous prime is 1042103130223. The next prime is 1042103130241. The reversal of 1042103130231 is 1320313012401.
It is not a de Polignac number, because 1042103130231 - 23 = 1042103130223 is a prime.
It is a super-2 number, since 2×10421031302312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1042103130198 and 1042103130207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042103130241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1255785 + ... + 1913426.
It is an arithmetic number, because the mean of its divisors is an integer number (88896396600).
Almost surely, 21042103130231 is an apocalyptic number.
1042103130231 is a deficient number, since it is larger than the sum of its proper divisors (380239215369).
1042103130231 is a wasteful number, since it uses less digits than its factorization.
1042103130231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3171806.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1042103130231 its reverse (1320313012401), we get a palindrome (2362416142632).
The spelling of 1042103130231 in words is "one trillion, forty-two billion, one hundred three million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •