Base | Representation |
---|---|
bin | 11101101101110010100… |
… | …011110000110010011101 |
3 | 21020012211200102101111221 |
4 | 131231302203300302131 |
5 | 231424040022134401 |
6 | 4202032444413341 |
7 | 300350304606346 |
oct | 35556243606235 |
9 | 7205750371457 |
10 | 2042031443101 |
11 | 718025572121 |
12 | 28b914247251 |
13 | 11a74144ca70 |
14 | 70b98b7d0cd |
15 | 381b7ed87a1 |
hex | 1db728f0c9d |
2042031443101 has 16 divisors (see below), whose sum is σ = 2429708085504. Its totient is φ = 1696938971904.
The previous prime is 2042031443083. The next prime is 2042031443113. The reversal of 2042031443101 is 1013441302402.
It is a cyclic number.
It is not a de Polignac number, because 2042031443101 - 213 = 2042031434909 is a prime.
It is a super-2 number, since 2×20420314431012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2042031443141) 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, 200863641 + ... + 200873806.
It is an arithmetic number, because the mean of its divisors is an integer number (151856755344).
Almost surely, 22042031443101 is an apocalyptic number.
It is an amenable number.
2042031443101 is a deficient number, since it is larger than the sum of its proper divisors (387676642403).
2042031443101 is a wasteful number, since it uses less digits than its factorization.
2042031443101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401737500.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 2042031443101 its reverse (1013441302402), we get a palindrome (3055472745503).
The spelling of 2042031443101 in words is "two trillion, forty-two billion, thirty-one million, four hundred forty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •