Base | Representation |
---|---|
bin | 1001101100010110100001… |
… | …11101100101111111111111 |
3 | 2210110201002022012221110010 |
4 | 10312023100331211333333 |
5 | 10243211343140430421 |
6 | 113200012005514303 |
7 | 4326652610415321 |
oct | 466132075457777 |
9 | 83421068187403 |
10 | 21315133530111 |
11 | 6878774214403 |
12 | 2483023112993 |
13 | bb80157aa705 |
14 | 53992d669611 |
15 | 26e6c769a076 |
hex | 1362d0f65fff |
21315133530111 has 8 divisors (see below), whose sum is σ = 29188290960304. Its totient is φ = 13826032560000.
The previous prime is 21315133530101. The next prime is 21315133530143. The reversal of 21315133530111 is 11103533151312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21315133530111 - 229 = 21314596659199 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 (21315133530101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96014114890 + ... + 96014115111.
It is an arithmetic number, because the mean of its divisors is an integer number (3648536370038).
Almost surely, 221315133530111 is an apocalyptic number.
21315133530111 is a deficient number, since it is larger than the sum of its proper divisors (7873157430193).
21315133530111 is a wasteful number, since it uses less digits than its factorization.
21315133530111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192028230041.
The product of its (nonzero) digits is 4050, while the sum is 30.
Adding to 21315133530111 its reverse (11103533151312), we get a palindrome (32418666681423).
The spelling of 21315133530111 in words is "twenty-one trillion, three hundred fifteen billion, one hundred thirty-three million, five hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •