Base | Representation |
---|---|
bin | 101101010111110100101… |
… | …011111010101110110001 |
3 | 102001001222202010102211101 |
4 | 231113310223322232301 |
5 | 402041033322134212 |
6 | 10344211443244401 |
7 | 441156603323401 |
oct | 55276453725661 |
9 | 12031882112741 |
10 | 3117956443057 |
11 | aa2355144265 |
12 | 424345379701 |
13 | 19803952c381 |
14 | aaca4a86801 |
15 | 5618a0d1157 |
hex | 2d5f4afabb1 |
3117956443057 has 8 divisors (see below), whose sum is σ = 3127425521832. Its totient is φ = 3108498921600.
The previous prime is 3117956443013. The next prime is 3117956443067. The reversal of 3117956443057 is 7503446597113.
It can be written as a sum of positive squares in 4 ways, for example, as 613764131761 + 2504192311296 = 783431^2 + 1582464^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3117956443057 - 223 = 3117948054449 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3117956442989 and 3117956443007.
It is not an unprimeable number, because it can be changed into a prime (3117956443067) 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, 2348794 + ... + 3428227.
It is an arithmetic number, because the mean of its divisors is an integer number (390928190229).
Almost surely, 23117956443057 is an apocalyptic number.
It is an amenable number.
3117956443057 is a deficient number, since it is larger than the sum of its proper divisors (9469078775).
3117956443057 is a wasteful number, since it uses less digits than its factorization.
3117956443057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5778659.
The product of its (nonzero) digits is 9525600, while the sum is 55.
The spelling of 3117956443057 in words is "three trillion, one hundred seventeen billion, nine hundred fifty-six million, four hundred forty-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •