Base | Representation |
---|---|
bin | 10011110000101111… |
… | …01011100111100101 |
3 | 1000101101110210102000 |
4 | 21320113223213211 |
5 | 133212002032420 |
6 | 4512432235513 |
7 | 523624325034 |
oct | 117027534745 |
9 | 30341423360 |
10 | 10609408485 |
11 | 4554809695 |
12 | 208109bb99 |
13 | 100102b600 |
14 | 72907871b |
15 | 421638690 |
hex | 2785eb9e5 |
10609408485 has 48 divisors (see below), whose sum is σ = 20423678400. Its totient is φ = 5223082176.
The previous prime is 10609408483. The next prime is 10609408489. The reversal of 10609408485 is 58480490601.
It is not a de Polignac number, because 10609408485 - 21 = 10609408483 is a prime.
It is a super-2 number, since 2×106094084852 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 10609408485.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10609408483) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 209695 + ... + 255324.
It is an arithmetic number, because the mean of its divisors is an integer number (425493300).
Almost surely, 210609408485 is an apocalyptic number.
10609408485 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10609408485 is a deficient number, since it is larger than the sum of its proper divisors (9814269915).
10609408485 is a wasteful number, since it uses less digits than its factorization.
10609408485 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 465059 (or 465040 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 45.
The spelling of 10609408485 in words is "ten billion, six hundred nine million, four hundred eight thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •