Base | Representation |
---|---|
bin | 11101101001011101010… |
… | …00110100111100100000 |
3 | 10121101102020101202010122 |
4 | 32310232220310330200 |
5 | 113142234031004322 |
6 | 2055551331415412 |
7 | 133412036420102 |
oct | 16645650647440 |
9 | 3541366352118 |
10 | 1018689703712 |
11 | 363029864a1a |
12 | 145519154568 |
13 | 750a6371b15 |
14 | 3743a6cb572 |
15 | 1b77245b442 |
hex | ed2ea34f20 |
1018689703712 has 54 divisors (see below), whose sum is σ = 2036690446203. Its totient is φ = 501554277312.
The previous prime is 1018689703711. The next prime is 1018689703723. The reversal of 1018689703712 is 2173079868101.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
1018689703712 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 509344851856 + 509344851856 = 713684^2 + 713684^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=713684.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1018689703711) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 382533293 + ... + 382535955.
Almost surely, 21018689703712 is an apocalyptic number.
It is an amenable number.
1018689703712 is a deficient number, since it is larger than the sum of its proper divisors (1018000742491).
1018689703712 is an frugal number, since it uses more digits than its factorization.
1018689703712 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5470 (or 2732 counting only the distinct ones).
The product of its (nonzero) digits is 1016064, while the sum is 53.
The spelling of 1018689703712 in words is "one trillion, eighteen billion, six hundred eighty-nine million, seven hundred three thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •