Base | Representation |
---|---|
bin | 11101101110000011001… |
… | …10011101100001010111 |
3 | 10121121210001220202100111 |
4 | 32313001212131201113 |
5 | 113212311231143411 |
6 | 2101040130423451 |
7 | 133530116061214 |
oct | 16670146354127 |
9 | 3547701822314 |
10 | 1021155334231 |
11 | 36408462369a |
12 | 145aa6a31b87 |
13 | 753aa1294a6 |
14 | 375d1d52b0b |
15 | 1b868b48721 |
hex | edc199d857 |
1021155334231 has 8 divisors (see below), whose sum is σ = 1036469564480. Its totient is φ = 1005900809472.
The previous prime is 1021155334193. The next prime is 1021155334237. The reversal of 1021155334231 is 1324335511201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1021155334231 - 27 = 1021155334103 is a prime.
It is a super-2 number, since 2×10211553342312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1021155334193 and 1021155334202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021155334237) 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, 14891910 + ... + 14960323.
It is an arithmetic number, because the mean of its divisors is an integer number (129558695560).
Almost surely, 21021155334231 is an apocalyptic number.
1021155334231 is a deficient number, since it is larger than the sum of its proper divisors (15314230249).
1021155334231 is an equidigital number, since it uses as much as digits as its factorization.
1021155334231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29852745.
The product of its (nonzero) digits is 10800, while the sum is 31.
The spelling of 1021155334231 in words is "one trillion, twenty-one billion, one hundred fifty-five million, three hundred thirty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •