Base | Representation |
---|---|
bin | 11101101110000010100… |
… | …11110000100001001111 |
3 | 10121121202201200122210212 |
4 | 32313001103300201033 |
5 | 113212304002300221 |
6 | 2101035433353035 |
7 | 133530026311043 |
oct | 16670123604117 |
9 | 3547681618725 |
10 | 1021150431311 |
11 | 364081884a9a |
12 | 145aa526877b |
13 | 753a910095a |
14 | 375d1438023 |
15 | 1b8684cab5b |
hex | edc14f084f |
1021150431311 has 8 divisors (see below), whose sum is σ = 1053084240000. Its totient is φ = 989704161880.
The previous prime is 1021150431299. The next prime is 1021150431347. The reversal of 1021150431311 is 1131340511201.
1021150431311 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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1021150431311 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 (1021150431611) 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, 121880561 + ... + 121888938.
It is an arithmetic number, because the mean of its divisors is an integer number (131635530000).
Almost surely, 21021150431311 is an apocalyptic number.
1021150431311 is a deficient number, since it is larger than the sum of its proper divisors (31933808689).
1021150431311 is an equidigital number, since it uses as much as digits as its factorization.
1021150431311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 243769629.
The product of its (nonzero) digits is 360, while the sum is 23.
Adding to 1021150431311 its reverse (1131340511201), we get a palindrome (2152490942512).
The spelling of 1021150431311 in words is "one trillion, twenty-one billion, one hundred fifty million, four hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •