Base | Representation |
---|---|
bin | 1011101100101111… |
… | …1011111111001101 |
3 | 22002212100100011000 |
4 | 2323023323333031 |
5 | 22412424444220 |
6 | 1235343050513 |
7 | 140552354244 |
oct | 27313737715 |
9 | 8085310130 |
10 | 3140468685 |
11 | 1371792672 |
12 | 7378a0a39 |
13 | 3b0826cc3 |
14 | 21b12d95b |
15 | 135a8e390 |
hex | bb2fbfcd |
3140468685 has 32 divisors (see below), whose sum is σ = 5645808000. Its totient is φ = 1656091008.
The previous prime is 3140468659. The next prime is 3140468693. The reversal of 3140468685 is 5868640413.
It is not a de Polignac number, because 3140468685 - 27 = 3140468557 is a prime.
It is a super-2 number, since 2×31404686852 = 19725087122931258450, which 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 3140468685.
It is a congruent number.
It is an unprimeable number.
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 in 31 ways as a sum of consecutive naturals, for example, 118675 + ... + 142704.
It is an arithmetic number, because the mean of its divisors is an integer number (176431500).
Almost surely, 23140468685 is an apocalyptic number.
It is an amenable number.
3140468685 is a deficient number, since it is larger than the sum of its proper divisors (2505339315).
3140468685 is a wasteful number, since it uses less digits than its factorization.
3140468685 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261482 (or 261476 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 45.
The square root of 3140468685 is about 56039.8847696888. The cubic root of 3140468685 is about 1464.4172042279.
The spelling of 3140468685 in words is "three billion, one hundred forty million, four hundred sixty-eight thousand, six hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •