Base | Representation |
---|---|
bin | 11101010001110101011… |
… | …001000101010010001001 |
3 | 21010100100201200122121010 |
4 | 131101311121011102021 |
5 | 230431101114012131 |
6 | 4140150115034133 |
7 | 265235405361012 |
oct | 35216531052211 |
9 | 7110321618533 |
10 | 2012014204041 |
11 | 706321624136 |
12 | 285b3759b949 |
13 | 11796963014a |
14 | 6d54c328009 |
15 | 3750cb06b46 |
hex | 1d475645489 |
2012014204041 has 16 divisors (see below), whose sum is σ = 2722414207680. Its totient is φ = 1321585013760.
The previous prime is 2012014204021. The next prime is 2012014204069. The reversal of 2012014204041 is 1404024102102.
It is not a de Polignac number, because 2012014204041 - 226 = 2011947095177 is a prime.
It is a super-3 number, since 3×20120142040413 (a number of 38 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2012014203999 and 2012014204017.
It is not an unprimeable number, because it can be changed into a prime (2012014204021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13238280 + ... + 13389401.
It is an arithmetic number, because the mean of its divisors is an integer number (170150887980).
Almost surely, 22012014204041 is an apocalyptic number.
It is an amenable number.
2012014204041 is a deficient number, since it is larger than the sum of its proper divisors (710400003639).
2012014204041 is a wasteful number, since it uses less digits than its factorization.
2012014204041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26628056.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 2012014204041 its reverse (1404024102102), we get a palindrome (3416038306143).
The spelling of 2012014204041 in words is "two trillion, twelve billion, fourteen million, two hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •