Base | Representation |
---|---|
bin | 10011110010001111… |
… | …00110000001111101 |
3 | 1000102021002220112002 |
4 | 21321013212001331 |
5 | 133223210443014 |
6 | 4514001352045 |
7 | 524136146135 |
oct | 117107460175 |
9 | 30367086462 |
10 | 10621968509 |
11 | 4560908179 |
12 | 2085338625 |
13 | 1003808489 |
14 | 72a9c7ac5 |
15 | 4227b9dde |
hex | 2791e607d |
10621968509 has 8 divisors (see below), whose sum is σ = 11273512248. Its totient is φ = 9973393920.
The previous prime is 10621968503. The next prime is 10621968517. The reversal of 10621968509 is 90586912601.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 900600100 + 9721368409 = 30010^2 + 98597^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 10621968509 - 24 = 10621968493 is a prime.
It is a super-2 number, since 2×106219685092 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10621968503) 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, 734912 + ... + 749225.
It is an arithmetic number, because the mean of its divisors is an integer number (1409189031).
Almost surely, 210621968509 is an apocalyptic number.
It is an amenable number.
10621968509 is a deficient number, since it is larger than the sum of its proper divisors (651543739).
10621968509 is a wasteful number, since it uses less digits than its factorization.
10621968509 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1484575.
The product of its (nonzero) digits is 233280, while the sum is 47.
The spelling of 10621968509 in words is "ten billion, six hundred twenty-one million, nine hundred sixty-eight thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •