Base | Representation |
---|---|
bin | 101101111100000010000… |
… | …100011011000111100001 |
3 | 102011210100022021010211121 |
4 | 231330002010123013201 |
5 | 403210144413123031 |
6 | 10414121424212241 |
7 | 444034221340543 |
oct | 55740204330741 |
9 | 12153308233747 |
10 | 3156835676641 |
11 | 1007896493969 |
12 | 42b995a6a081 |
13 | 19b8c433ca2a |
14 | acb1246b693 |
15 | 571b34ce011 |
hex | 2df0211b1e1 |
3156835676641 has 32 divisors (see below), whose sum is σ = 3548078726400. Its totient is φ = 2791158497280.
The previous prime is 3156835676623. The next prime is 3156835676651. The reversal of 3156835676641 is 1466765386513.
It is a cyclic number.
It is not a de Polignac number, because 3156835676641 - 215 = 3156835643873 is a prime.
It is a super-2 number, since 2×31568356766412 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3156835676641.
It is not an unprimeable number, because it can be changed into a prime (3156835676651) 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 31 ways as a sum of consecutive naturals, for example, 19306015 + ... + 19468843.
It is an arithmetic number, because the mean of its divisors is an integer number (110877460200).
Almost surely, 23156835676641 is an apocalyptic number.
It is an amenable number.
3156835676641 is a deficient number, since it is larger than the sum of its proper divisors (391243049759).
3156835676641 is a wasteful number, since it uses less digits than its factorization.
3156835676641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163369.
The product of its digits is 65318400, while the sum is 61.
The spelling of 3156835676641 in words is "three trillion, one hundred fifty-six billion, eight hundred thirty-five million, six hundred seventy-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •