Base | Representation |
---|---|
bin | 11101100010000111011… |
… | …00110011011000100111 |
3 | 10121000020112120112111222 |
4 | 32301003230303120213 |
5 | 113111201003201020 |
6 | 2054100245250555 |
7 | 133212255351350 |
oct | 16610354633047 |
9 | 3530215515458 |
10 | 1014748100135 |
11 | 361396936900 |
12 | 1447b9103a5b |
13 | 748c8888503 |
14 | 37185018d27 |
15 | 1b5e13bdb25 |
hex | ec43b33627 |
1014748100135 has 48 divisors (see below), whose sum is σ = 1529892403200. Its totient is φ = 632478221760.
The previous prime is 1014748100129. The next prime is 1014748100137. The reversal of 1014748100135 is 5310018474101.
It is not a de Polignac number, because 1014748100135 - 28 = 1014748099879 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a junction number, because it is equal to n+sod(n) for n = 1014748100095 and 1014748100104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1014748100137) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 39876746 + ... + 39902184.
It is an arithmetic number, because the mean of its divisors is an integer number (31872758400).
Almost surely, 21014748100135 is an apocalyptic number.
1014748100135 is a deficient number, since it is larger than the sum of its proper divisors (515144303065).
1014748100135 is a wasteful number, since it uses less digits than its factorization.
1014748100135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34892 (or 34881 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 35.
The spelling of 1014748100135 in words is "one trillion, fourteen billion, seven hundred forty-eight million, one hundred thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •