Base | Representation |
---|---|
bin | 11101100001110101110… |
… | …00100111101100000101 |
3 | 10120222212020021120210210 |
4 | 32300322320213230011 |
5 | 113110400122444023 |
6 | 2054033443310033 |
7 | 133205511300405 |
oct | 16607270475405 |
9 | 3528766246723 |
10 | 1014600203013 |
11 | 361320400581 |
12 | 14477767b319 |
13 | 748a4044817 |
14 | 3716d51a805 |
15 | 1b5d3407593 |
hex | ec3ae27b05 |
1014600203013 has 16 divisors (see below), whose sum is σ = 1399565920320. Its totient is φ = 653021222784.
The previous prime is 1014600203003. The next prime is 1014600203063. The reversal of 1014600203013 is 3103020064101.
It is not a de Polignac number, because 1014600203013 - 25 = 1014600202981 is a prime.
It is a super-3 number, since 3×10146002030133 (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 (1014600203003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 567370 + ... + 1533332.
It is an arithmetic number, because the mean of its divisors is an integer number (87472870020).
Almost surely, 21014600203013 is an apocalyptic number.
It is an amenable number.
1014600203013 is a deficient number, since it is larger than the sum of its proper divisors (384965717307).
1014600203013 is a wasteful number, since it uses less digits than its factorization.
1014600203013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 978068.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1014600203013 its reverse (3103020064101), we get a palindrome (4117620267114).
The spelling of 1014600203013 in words is "one trillion, fourteen billion, six hundred million, two hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •