Base | Representation |
---|---|
bin | 110010101110011101110… |
… | …111111101100100001100 |
3 | 110100020122002001211200201 |
4 | 302232131313331210030 |
5 | 424103023443420220 |
6 | 11225215115103244 |
7 | 506563016026552 |
oct | 62563567754414 |
9 | 13306562054621 |
10 | 3485867170060 |
11 | 1124391160930 |
12 | 483701a41b24 |
13 | 1c393c9a21c2 |
14 | c0a07147bd2 |
15 | 60a1e756d0a |
hex | 32b9ddfd90c |
3485867170060 has 48 divisors (see below), whose sum is σ = 7990033272480. Its totient is φ = 1266916874240.
The previous prime is 3485867170043. The next prime is 3485867170063. The reversal of 3485867170060 is 600717685843.
It is a super-2 number, since 2×34858671700602 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (55).
It is a junction number, because it is equal to n+sod(n) for n = 3485867169983 and 3485867170010.
It is not an unprimeable number, because it can be changed into a prime (3485867170063) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3778399 + ... + 4609558.
It is an arithmetic number, because the mean of its divisors is an integer number (166459026510).
Almost surely, 23485867170060 is an apocalyptic number.
It is an amenable number.
3485867170060 is an abundant number, since it is smaller than the sum of its proper divisors (4504166102420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3485867170060 is a wasteful number, since it uses less digits than its factorization.
3485867170060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8389866 (or 8389864 counting only the distinct ones).
The product of its (nonzero) digits is 6773760, while the sum is 55.
The spelling of 3485867170060 in words is "three trillion, four hundred eighty-five billion, eight hundred sixty-seven million, one hundred seventy thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •