Base | Representation |
---|---|
bin | 10000010111110101001… |
… | …101100011011010111011 |
3 | 10222120002011221222122100 |
4 | 100113311031203122323 |
5 | 121413201202411011 |
6 | 2220510342554443 |
7 | 144200015622501 |
oct | 20276515433273 |
9 | 3876064858570 |
10 | 1125100435131 |
11 | 3a4174956462 |
12 | 162075a38a23 |
13 | 8213407835a |
14 | 3c652d16671 |
15 | 1e3ee3b1d56 |
hex | 105f53636bb |
1125100435131 has 12 divisors (see below), whose sum is σ = 1625672928880. Its totient is φ = 749823330960.
The previous prime is 1125100435097. The next prime is 1125100435133. The reversal of 1125100435131 is 1315340015211.
1125100435131 is a `hidden beast` number, since 1 + 1 + 2 + 5 + 100 + 43 + 513 + 1 = 666.
It is not a de Polignac number, because 1125100435131 - 27 = 1125100435003 is a prime.
It is a super-2 number, since 2×11251004351312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1125100435095 and 1125100435104.
It is not an unprimeable number, because it can be changed into a prime (1125100435133) 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 11 ways as a sum of consecutive naturals, for example, 20272900 + ... + 20328321.
Almost surely, 21125100435131 is an apocalyptic number.
1125100435131 is a deficient number, since it is larger than the sum of its proper divisors (500572493749).
1125100435131 is a wasteful number, since it uses less digits than its factorization.
1125100435131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40604306 (or 40604303 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The spelling of 1125100435131 in words is "one trillion, one hundred twenty-five billion, one hundred million, four hundred thirty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •