Base | Representation |
---|---|
bin | 11101101100100011110… |
… | …11000111001001001111 |
3 | 10121112201022202222102211 |
4 | 32312101323013021033 |
5 | 113204141443104411 |
6 | 2100424514131251 |
7 | 133501234101520 |
oct | 16662173071117 |
9 | 3545638688384 |
10 | 1020355441231 |
11 | 3638040561a5 |
12 | 145902b80b27 |
13 | 752b04b3219 |
14 | 37557a14847 |
15 | 1b81d7e3221 |
hex | ed91ec724f |
1020355441231 has 16 divisors (see below), whose sum is σ = 1179385470720. Its totient is φ = 864644362560.
The previous prime is 1020355441211. The next prime is 1020355441267. The reversal of 1020355441231 is 1321445530201.
It is a cyclic number.
It is not a de Polignac number, because 1020355441231 - 29 = 1020355440719 is a prime.
It is a super-2 number, since 2×10203554412312 (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 = 1020355441193 and 1020355441202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020355441211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4567776 + ... + 4785946.
It is an arithmetic number, because the mean of its divisors is an integer number (73711591920).
Almost surely, 21020355441231 is an apocalyptic number.
1020355441231 is a deficient number, since it is larger than the sum of its proper divisors (159030029489).
1020355441231 is an equidigital number, since it uses as much as digits as its factorization.
1020355441231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225774.
The product of its (nonzero) digits is 14400, while the sum is 31.
The spelling of 1020355441231 in words is "one trillion, twenty billion, three hundred fifty-five million, four hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •