Base | Representation |
---|---|
bin | 1001101100001111011010… |
… | …00100000110100111010001 |
3 | 2210110100012211122002010112 |
4 | 10312013231010012213101 |
5 | 10243131030332000223 |
6 | 113154140343011105 |
7 | 4326456062255441 |
oct | 466075504064721 |
9 | 83410184562115 |
10 | 21311310031313 |
11 | 6877091a23145 |
12 | 2482336739a95 |
13 | bb78566064a3 |
14 | 53968993c121 |
15 | 26e551b8b778 |
hex | 1361ed1069d1 |
21311310031313 has 4 divisors (see below), whose sum is σ = 21311862133488. Its totient is φ = 21310757929140.
The previous prime is 21311310031301. The next prime is 21311310031331. The reversal of 21311310031313 is 31313001311312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21311310031313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21311310031343) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 275993183 + ... + 276070388.
It is an arithmetic number, because the mean of its divisors is an integer number (5327965533372).
Almost surely, 221311310031313 is an apocalyptic number.
It is an amenable number.
21311310031313 is a deficient number, since it is larger than the sum of its proper divisors (552102175).
21311310031313 is an equidigital number, since it uses as much as digits as its factorization.
21311310031313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552102174.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 21311310031313 its reverse (31313001311312), we get a palindrome (52624311342625).
The spelling of 21311310031313 in words is "twenty-one trillion, three hundred eleven billion, three hundred ten million, thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •