Base | Representation |
---|---|
bin | 1001100110001000010000… |
… | …00101100100100010000011 |
3 | 2202201021011120112100010101 |
4 | 10303010020011210202003 |
5 | 10231210440330101311 |
6 | 112513450305343231 |
7 | 4305343063422055 |
oct | 463041005444203 |
9 | 82637146470111 |
10 | 21101310003331 |
11 | 67a6019428a08 |
12 | 24496aa037b17 |
13 | ba0aca5ba1bc |
14 | 52d4476cb8d5 |
15 | 268d60850ec1 |
hex | 133108164883 |
21101310003331 has 2 divisors, whose sum is σ = 21101310003332. Its totient is φ = 21101310003330.
The previous prime is 21101310003329. The next prime is 21101310003337. The reversal of 21101310003331 is 13330001310112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21101310003331 - 21 = 21101310003329 is a prime.
It is a super-2 number, since 2×211013100033312 (a number of 27 digits) contains 22 as substring.
Together with 21101310003329, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 21101310003299 and 21101310003308.
It is not a weakly prime, because it can be changed into another prime (21101310003337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10550655001665 + 10550655001666.
It is an arithmetic number, because the mean of its divisors is an integer number (10550655001666).
Almost surely, 221101310003331 is an apocalyptic number.
21101310003331 is a deficient number, since it is larger than the sum of its proper divisors (1).
21101310003331 is an equidigital number, since it uses as much as digits as its factorization.
21101310003331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 21101310003331 its reverse (13330001310112), we get a palindrome (34431311313443).
The spelling of 21101310003331 in words is "twenty-one trillion, one hundred one billion, three hundred ten million, three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •