Base | Representation |
---|---|
bin | 111101000100011010011… |
… | …111101001101111110001 |
3 | 112212012020012010100012221 |
4 | 331010122133221233301 |
5 | 1022224143123201030 |
6 | 12531523140521041 |
7 | 612124225430650 |
oct | 75043237515761 |
9 | 15765205110187 |
10 | 4196627553265 |
11 | 1378863936704 |
12 | 5794020b0181 |
13 | 24598151b1a4 |
14 | 107191587197 |
15 | 7426d31ae7a |
hex | 3d11a7e9bf1 |
4196627553265 has 8 divisors (see below), whose sum is σ = 5755374930240. Its totient is φ = 2877687465072.
The previous prime is 4196627553263. The next prime is 4196627553271. The reversal of 4196627553265 is 5623557266914.
4196627553265 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4196627553265 - 21 = 4196627553263 is a prime.
It is a super-2 number, since 2×41966275532652 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4196627553263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59951822155 + ... + 59951822224.
It is an arithmetic number, because the mean of its divisors is an integer number (719421866280).
Almost surely, 24196627553265 is an apocalyptic number.
It is an amenable number.
4196627553265 is a deficient number, since it is larger than the sum of its proper divisors (1558747376975).
4196627553265 is a wasteful number, since it uses less digits than its factorization.
4196627553265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119903644391.
The product of its digits is 81648000, while the sum is 61.
The spelling of 4196627553265 in words is "four trillion, one hundred ninety-six billion, six hundred twenty-seven million, five hundred fifty-three thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •