Base | Representation |
---|---|
bin | 111100101101001100101… |
… | …100101111001111100100 |
3 | 112202210212221121111102221 |
4 | 330231030230233033210 |
5 | 1021322120202300201 |
6 | 12512241425442124 |
7 | 610252421163100 |
oct | 74551454571744 |
9 | 15683787544387 |
10 | 4171700040676 |
11 | 1369231a0a533 |
12 | 574605aa0344 |
13 | 24350b01473c |
14 | 105ca8aac900 |
15 | 737aebb64a1 |
hex | 3cb4cb2f3e4 |
4171700040676 has 81 divisors (see below), whose sum is σ = 8730330891849. Its totient is φ = 1739109421728.
The previous prime is 4171700040653. The next prime is 4171700040727. The reversal of 4171700040676 is 6760400071714.
The square root of 4171700040676 is 2042474.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 3732894484900 + 438805555776 = 1932070^2 + 662424^2 .
It is a super-2 number, since 2×41717000406762 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1057999561 + ... + 1058003503.
Almost surely, 24171700040676 is an apocalyptic number.
4171700040676 is the 2042474-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4171700040676
4171700040676 is an abundant number, since it is smaller than the sum of its proper divisors (4558630851173).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4171700040676 is an frugal number, since it uses more digits than its factorization.
4171700040676 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7978 (or 3989 counting only the distinct ones).
The product of its (nonzero) digits is 197568, while the sum is 43.
The spelling of 4171700040676 in words is "four trillion, one hundred seventy-one billion, seven hundred million, forty thousand, six hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •