Base | Representation |
---|---|
bin | 11101010011001011000… |
… | …011111110000100011001 |
3 | 21010111001220020100202200 |
4 | 131103023003332010121 |
5 | 230442022041310131 |
6 | 4140544501320413 |
7 | 265316130311346 |
oct | 35231303760431 |
9 | 7114056210680 |
10 | 2013451510041 |
11 | 706999983434 |
12 | 286278a06109 |
13 | 117b3834117a |
14 | 6d64718b7cd |
15 | 37593dba2e6 |
hex | 1d4cb0fe119 |
2013451510041 has 24 divisors (see below), whose sum is σ = 3002449781760. Its totient is φ = 1298865024000.
The previous prime is 2013451510009. The next prime is 2013451510073. The reversal of 2013451510041 is 1400151543102.
2013451510041 is a `hidden beast` number, since 2 + 0 + 1 + 3 + 4 + 515 + 100 + 41 = 666.
It is an interprime number because it is at equal distance from previous prime (2013451510009) and next prime (2013451510073).
It is not a de Polignac number, because 2013451510041 - 25 = 2013451510009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2013451509987 and 2013451510014.
It is not an unprimeable number, because it can be changed into a prime (2013451510241) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2327641 + ... + 3073241.
It is an arithmetic number, because the mean of its divisors is an integer number (125102074240).
Almost surely, 22013451510041 is an apocalyptic number.
It is an amenable number.
2013451510041 is a deficient number, since it is larger than the sum of its proper divisors (988998271719).
2013451510041 is a wasteful number, since it uses less digits than its factorization.
2013451510041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 755317 (or 755314 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The spelling of 2013451510041 in words is "two trillion, thirteen billion, four hundred fifty-one million, five hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •