Base | Representation |
---|---|
bin | 10011110010100010… |
… | …01100011011000101 |
3 | 1000102102211202120201 |
4 | 21321101030123011 |
5 | 133224332010221 |
6 | 4514131330501 |
7 | 524166430051 |
oct | 117121143305 |
9 | 30372752521 |
10 | 10624485061 |
11 | 4562276973 |
12 | 2086150a31 |
13 | 10041a9a68 |
14 | 72b080c61 |
15 | 422b15891 |
hex | 27944c6c5 |
10624485061 has 8 divisors (see below), whose sum is σ = 10653476120. Its totient is φ = 10595515392.
The previous prime is 10624485049. The next prime is 10624485083. The reversal of 10624485061 is 16058442601.
It can be written as a sum of positive squares in 4 ways, for example, as 812592036 + 9811893025 = 28506^2 + 99055^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10624485061 - 225 = 10590930629 is a prime.
It is a super-2 number, since 2×106244850612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10624485061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10624485041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1639135 + ... + 1645603.
It is an arithmetic number, because the mean of its divisors is an integer number (1331684515).
Almost surely, 210624485061 is an apocalyptic number.
It is an amenable number.
10624485061 is a deficient number, since it is larger than the sum of its proper divisors (28991059).
10624485061 is an equidigital number, since it uses as much as digits as its factorization.
10624485061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10695.
The product of its (nonzero) digits is 46080, while the sum is 37.
The spelling of 10624485061 in words is "ten billion, six hundred twenty-four million, four hundred eighty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •