Base | Representation |
---|---|
bin | 1100111101010110… |
… | …1101010000111101 |
3 | 22222102112212122022 |
4 | 3033111231100331 |
5 | 24111003333031 |
6 | 1333101525525 |
7 | 152126251400 |
oct | 31725552075 |
9 | 8872485568 |
10 | 3478574141 |
11 | 1525623269 |
12 | 810b738a5 |
13 | 4358a71c3 |
14 | 24ddc1d37 |
15 | 1555c897b |
hex | cf56d43d |
3478574141 has 12 divisors (see below), whose sum is σ = 4051275228. Its totient is φ = 2978119872.
The previous prime is 3478574123. The next prime is 3478574147. The reversal of 3478574141 is 1414758743.
It can be written as a sum of positive squares in 2 ways, for example, as 1309716100 + 2168858041 = 36190^2 + 46571^2 .
It is not a de Polignac number, because 3478574141 - 210 = 3478573117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3478574092 and 3478574101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3478574147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 575 + ... + 83411.
It is an arithmetic number, because the mean of its divisors is an integer number (337606269).
Almost surely, 23478574141 is an apocalyptic number.
It is an amenable number.
3478574141 is a deficient number, since it is larger than the sum of its proper divisors (572701087).
3478574141 is an equidigital number, since it uses as much as digits as its factorization.
3478574141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83708 (or 83701 counting only the distinct ones).
The product of its digits is 376320, while the sum is 44.
The square root of 3478574141 is about 58979.4382899668. The cubic root of 3478574141 is about 1515.1899743980.
The spelling of 3478574141 in words is "three billion, four hundred seventy-eight million, five hundred seventy-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •