Base | Representation |
---|---|
bin | 11101101101110011001… |
… | …100110011010011011011 |
3 | 21020012212102122222000000 |
4 | 131231303030303103123 |
5 | 231424100300420212 |
6 | 4202033511144043 |
7 | 300350465214363 |
oct | 35556314632333 |
9 | 7205772588000 |
10 | 2042042201307 |
11 | 71803064a9a9 |
12 | 28b917975023 |
13 | 11a743748774 |
14 | 70b9a37d9a3 |
15 | 381b8e111dc |
hex | 1db733334db |
2042042201307 has 28 divisors (see below), whose sum is σ = 3062150548800. Its totient is φ = 1361144558448.
The previous prime is 2042042201293. The next prime is 2042042201377. The reversal of 2042042201307 is 7031022402402.
2042042201307 is a `hidden beast` number, since 2 + 0 + 420 + 4 + 2 + 201 + 30 + 7 = 666.
It is not a de Polignac number, because 2042042201307 - 28 = 2042042201051 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (2042042201377) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 4421569 + ... + 4861517.
It is an arithmetic number, because the mean of its divisors is an integer number (109362519600).
Almost surely, 22042042201307 is an apocalyptic number.
2042042201307 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
2042042201307 is a deficient number, since it is larger than the sum of its proper divisors (1020108347493).
2042042201307 is an frugal number, since it uses more digits than its factorization.
2042042201307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 446334 (or 446319 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 27.
Adding to 2042042201307 its reverse (7031022402402), we get a palindrome (9073064603709).
The spelling of 2042042201307 in words is "two trillion, forty-two billion, forty-two million, two hundred one thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •