Base | Representation |
---|---|
bin | 11101010001111101001… |
… | …110100001000000100000 |
3 | 21010100200220000212221120 |
4 | 131101331032201000200 |
5 | 230431333241323434 |
6 | 4140211132252240 |
7 | 265241562561324 |
oct | 35217516410040 |
9 | 7110626025846 |
10 | 2012145651744 |
11 | 7063898447a8 |
12 | 285b73611080 |
13 | 11798a934857 |
14 | 6d561983984 |
15 | 3751941e349 |
hex | 1d47d3a1020 |
2012145651744 has 96 divisors (see below), whose sum is σ = 5472642631680. Its totient is φ = 646812536832.
The previous prime is 2012145651697. The next prime is 2012145651767. The reversal of 2012145651744 is 4471565412102.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 2012145651696 and 2012145651705.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2105184 + ... + 2907935.
It is an arithmetic number, because the mean of its divisors is an integer number (57006694080).
Almost surely, 22012145651744 is an apocalyptic number.
2012145651744 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
2012145651744 is an abundant number, since it is smaller than the sum of its proper divisors (3460496979936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012145651744 is a wasteful number, since it uses less digits than its factorization.
2012145651744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5013282 (or 5013274 counting only the distinct ones).
The product of its (nonzero) digits is 268800, while the sum is 42.
The spelling of 2012145651744 in words is "two trillion, twelve billion, one hundred forty-five million, six hundred fifty-one thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •