Base | Representation |
---|---|
bin | 1101110100001101011… |
… | …11101110101100101001 |
3 | 1200101022011002022102012 |
4 | 12322012233232230221 |
5 | 30234200001432140 |
6 | 1002024415445305 |
7 | 46203453306113 |
oct | 6720657565451 |
9 | 1611264068365 |
10 | 474707061545 |
11 | 17335a840482 |
12 | 78002526835 |
13 | 359c30199c2 |
14 | 18d93dc43b3 |
15 | c535399265 |
hex | 6e86beeb29 |
474707061545 has 8 divisors (see below), whose sum is σ = 570104565000. Its totient is φ = 379461588480.
The previous prime is 474707061523. The next prime is 474707061547. The reversal of 474707061545 is 545160707474.
It can be written as a sum of positive squares in 4 ways, for example, as 139734663721 + 334972397824 = 373811^2 + 578768^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 474707061545 - 210 = 474707060521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 474707061493 and 474707061502.
It is not an unprimeable number, because it can be changed into a prime (474707061547) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 38000726 + ... + 38013215.
It is an arithmetic number, because the mean of its divisors is an integer number (71263070625).
Almost surely, 2474707061545 is an apocalyptic number.
It is an amenable number.
474707061545 is a deficient number, since it is larger than the sum of its proper divisors (95397503455).
474707061545 is a wasteful number, since it uses less digits than its factorization.
474707061545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76015195.
The product of its (nonzero) digits is 3292800, while the sum is 50.
The spelling of 474707061545 in words is "four hundred seventy-four billion, seven hundred seven million, sixty-one thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •