Base | Representation |
---|---|
bin | 11110010101000111111… |
… | …11011011101000111101 |
3 | 10200121221001211220202222 |
4 | 33022203333123220331 |
5 | 114033242122301000 |
6 | 2114425515255125 |
7 | 135202015513166 |
oct | 17124377335075 |
9 | 3617831756688 |
10 | 1042133400125 |
11 | 371a6a155034 |
12 | 149b8044a4a5 |
13 | 7737133172c |
14 | 386220b676d |
15 | 1c1956b1a85 |
hex | f2a3fdba3d |
1042133400125 has 8 divisors (see below), whose sum is σ = 1300582483512. Its totient is φ = 833706720000.
The previous prime is 1042133400107. The next prime is 1042133400131. The reversal of 1042133400125 is 5210043312401.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 19458297049 + 1022675103076 = 139493^2 + 1011274^2 .
It is not a de Polignac number, because 1042133400125 - 28 = 1042133399869 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1042133400094 and 1042133400103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4168533476 + ... + 4168533725.
It is an arithmetic number, because the mean of its divisors is an integer number (162572810439).
Almost surely, 21042133400125 is an apocalyptic number.
It is an amenable number.
1042133400125 is a deficient number, since it is larger than the sum of its proper divisors (258449083387).
1042133400125 is an frugal number, since it uses more digits than its factorization.
1042133400125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8337067216 (or 8337067206 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 1042133400125 its reverse (5210043312401), we get a palindrome (6252176712526).
The spelling of 1042133400125 in words is "one trillion, forty-two billion, one hundred thirty-three million, four hundred thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •