Base | Representation |
---|---|
bin | 1011100100111010… |
… | …01100011100001101 |
3 | 121001011001001012102 |
4 | 11302131030130031 |
5 | 100212044114203 |
6 | 2504421444445 |
7 | 310006344554 |
oct | 56235143415 |
9 | 17034031172 |
10 | 6215223053 |
11 | 26aa371086 |
12 | 1255570725 |
13 | 7808530a0 |
14 | 42d634d9b |
15 | 26599c888 |
hex | 17274c70d |
6215223053 has 12 divisors (see below), whose sum is σ = 6852622140. Its totient is φ = 5603685696.
The previous prime is 6215223031. The next prime is 6215223059. The reversal of 6215223053 is 3503225126.
It can be written as a sum of positive squares in 2 ways, for example, as 1156884169 + 5058338884 = 34013^2 + 71122^2 .
It is not a de Polignac number, because 6215223053 - 212 = 6215218957 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6215223059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 105248 + ... + 153321.
It is an arithmetic number, because the mean of its divisors is an integer number (571051845).
Almost surely, 26215223053 is an apocalyptic number.
It is an amenable number.
6215223053 is a deficient number, since it is larger than the sum of its proper divisors (637399087).
6215223053 is a wasteful number, since it uses less digits than its factorization.
6215223053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258668 (or 258625 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 6215223053 is about 78836.6859590128. The cubic root of 6215223053 is about 1838.5928763195.
Adding to 6215223053 its reverse (3503225126), we get a palindrome (9718448179).
The spelling of 6215223053 in words is "six billion, two hundred fifteen million, two hundred twenty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •