Base | Representation |
---|---|
bin | 11101100001110101111… |
… | …11101101000011101101 |
3 | 10120222212100202221010120 |
4 | 32300322333231003231 |
5 | 113110401111410023 |
6 | 2054033551155153 |
7 | 133205533133403 |
oct | 16607277550355 |
9 | 3528770687116 |
10 | 1014602060013 |
11 | 361321459793 |
12 | 144778215ab9 |
13 | 748a4544b39 |
14 | 3716d881473 |
15 | 1b5d36728e3 |
hex | ec3afed0ed |
1014602060013 has 8 divisors (see below), whose sum is σ = 1352811650976. Its totient is φ = 676396921200.
The previous prime is 1014602060009. The next prime is 1014602060039. The reversal of 1014602060013 is 3100602064101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1014602060013 - 22 = 1014602060009 is a prime.
It is a super-3 number, since 3×10146020600133 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1014602060093) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 538998 + ... + 1523063.
It is an arithmetic number, because the mean of its divisors is an integer number (169101456372).
Almost surely, 21014602060013 is an apocalyptic number.
It is an amenable number.
1014602060013 is a deficient number, since it is larger than the sum of its proper divisors (338209590963).
1014602060013 is a wasteful number, since it uses less digits than its factorization.
1014602060013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2226075.
The product of its (nonzero) digits is 864, while the sum is 24.
The spelling of 1014602060013 in words is "one trillion, fourteen billion, six hundred two million, sixty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •