Base | Representation |
---|---|
bin | 101100100010110010001… |
… | …1100001011110111101101 |
3 | 210200020222122110220210222 |
4 | 1121011210130023313231 |
5 | 1300300340424211203 |
6 | 21004225243541125 |
7 | 1201205126132423 |
oct | 131054434136755 |
9 | 23606878426728 |
10 | 6122013507053 |
11 | 1a5037102a194 |
12 | 82a5a1b2a7a5 |
13 | 3553c3740452 |
14 | 172442709113 |
15 | a93aaabd038 |
hex | 5916470bded |
6122013507053 has 2 divisors, whose sum is σ = 6122013507054. Its totient is φ = 6122013507052.
The previous prime is 6122013507037. The next prime is 6122013507119. The reversal of 6122013507053 is 3507053102216.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3849436152004 + 2272577355049 = 1961998^2 + 1507507^2 .
It is a cyclic number.
It is not a de Polignac number, because 6122013507053 - 24 = 6122013507037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6122013501053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3061006753526 + 3061006753527.
It is an arithmetic number, because the mean of its divisors is an integer number (3061006753527).
Almost surely, 26122013507053 is an apocalyptic number.
It is an amenable number.
6122013507053 is a deficient number, since it is larger than the sum of its proper divisors (1).
6122013507053 is an equidigital number, since it uses as much as digits as its factorization.
6122013507053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37800, while the sum is 35.
Adding to 6122013507053 its reverse (3507053102216), we get a palindrome (9629066609269).
The spelling of 6122013507053 in words is "six trillion, one hundred twenty-two billion, thirteen million, five hundred seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •