Base | Representation |
---|---|
bin | 10000101000000011110… |
… | …011000010100111001111 |
3 | 11001020001112101020010011 |
4 | 100220003303002213033 |
5 | 122204342400344211 |
6 | 2232511352054051 |
7 | 145354556240425 |
oct | 20500363024717 |
9 | 4036045336104 |
10 | 1142525012431 |
11 | 4005a6647270 |
12 | 165519394327 |
13 | 83980006a1a |
14 | 3d427157115 |
15 | 1eabdea4921 |
hex | 10a03cc29cf |
1142525012431 has 16 divisors (see below), whose sum is σ = 1248316243200. Its totient is φ = 1037055902400.
The previous prime is 1142525012413. The next prime is 1142525012437. The reversal of 1142525012431 is 1342105252411.
It is a cyclic number.
It is not a de Polignac number, because 1142525012431 - 29 = 1142525011919 is a prime.
It is a super-2 number, since 2×11425250124312 (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 = 1142525012393 and 1142525012402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1142525012437) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19331716 + ... + 19390726.
It is an arithmetic number, because the mean of its divisors is an integer number (78019765200).
Almost surely, 21142525012431 is an apocalyptic number.
1142525012431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1142525012431 is a deficient number, since it is larger than the sum of its proper divisors (105791230769).
1142525012431 is a wasteful number, since it uses less digits than its factorization.
1142525012431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61710.
The product of its (nonzero) digits is 9600, while the sum is 31.
The spelling of 1142525012431 in words is "one trillion, one hundred forty-two billion, five hundred twenty-five million, twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •