Base | Representation |
---|---|
bin | 10111111000000001100010… |
… | …000101011110101001010101 |
3 | 111202210101021102012122120011 |
4 | 113320001202011132221111 |
5 | 102230400223022243041 |
6 | 1011154344524240221 |
7 | 31055234636524051 |
oct | 2770014205365125 |
9 | 452711242178504 |
10 | 105005006056021 |
11 | 30504411497715 |
12 | b93a8100a0071 |
13 | 4678c113a9426 |
14 | 1bd03ab394c61 |
15 | c2164b741e81 |
hex | 5f806215ea55 |
105005006056021 has 2 divisors, whose sum is σ = 105005006056022. Its totient is φ = 105005006056020.
The previous prime is 105005006056009. The next prime is 105005006056031. The reversal of 105005006056021 is 120650600500501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69663895320100 + 35341110735921 = 8346490^2 + 5944839^2 .
It is a cyclic number.
It is not a de Polignac number, because 105005006056021 - 243 = 96208913033813 is a prime.
It is a super-2 number, since 2×1050050060560212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105005006056031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52502503028010 + 52502503028011.
It is an arithmetic number, because the mean of its divisors is an integer number (52502503028011).
Almost surely, 2105005006056021 is an apocalyptic number.
It is an amenable number.
105005006056021 is a deficient number, since it is larger than the sum of its proper divisors (1).
105005006056021 is an equidigital number, since it uses as much as digits as its factorization.
105005006056021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 105005006056021 its reverse (120650600500501), we get a palindrome (225655606556522).
The spelling of 105005006056021 in words is "one hundred five trillion, five billion, six million, fifty-six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •