Base | Representation |
---|---|
bin | 11101101100010101011… |
… | …00010010000001101111 |
3 | 10121112101212110212120122 |
4 | 32312022230102001233 |
5 | 113203414413110020 |
6 | 2100404501435155 |
7 | 133465231606346 |
oct | 16661254220157 |
9 | 3545355425518 |
10 | 1020234113135 |
11 | 363751617646 |
12 | 14588a40babb |
13 | 75291312953 |
14 | 37545870b5d |
15 | 1b812d29125 |
hex | ed8ab1206f |
1020234113135 has 8 divisors (see below), whose sum is σ = 1236902389296. Its totient is φ = 807772988160.
The previous prime is 1020234113131. The next prime is 1020234113189. The reversal of 1020234113135 is 5313114320201.
1020234113135 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1020234113135 - 22 = 1020234113131 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020234113131) 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, 1051787261 + ... + 1051788230.
It is an arithmetic number, because the mean of its divisors is an integer number (154612798662).
Almost surely, 21020234113135 is an apocalyptic number.
1020234113135 is a deficient number, since it is larger than the sum of its proper divisors (216668276161).
1020234113135 is an equidigital number, since it uses as much as digits as its factorization.
1020234113135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2103575593.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 1020234113135 its reverse (5313114320201), we get a palindrome (6333348433336).
The spelling of 1020234113135 in words is "one trillion, twenty billion, two hundred thirty-four million, one hundred thirteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •