Base | Representation |
---|---|
bin | 101111011100110001100… |
… | …001111001110101110001 |
3 | 102112201110120021212121101 |
4 | 233130301201321311301 |
5 | 411410414023231123 |
6 | 10533541112124401 |
7 | 454402314313201 |
oct | 57346141716561 |
9 | 12481416255541 |
10 | 3260711148913 |
11 | 1047950489709 |
12 | 447b45696701 |
13 | 1a8639a2011a |
14 | b3b680a8401 |
15 | 59c42a91aad |
hex | 2f731879d71 |
3260711148913 has 8 divisors (see below), whose sum is σ = 3348910684520. Its totient is φ = 3172515413760.
The previous prime is 3260711148887. The next prime is 3260711148953. The reversal of 3260711148913 is 3198411170623.
It can be written as a sum of positive squares in 4 ways, for example, as 1454850893584 + 1805860255329 = 1206172^2 + 1343823^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 3260711148913 - 229 = 3260174278001 is a prime.
It is a super-2 number, since 2×32607111489132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3260711148953) 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, 833743 + ... + 2686363.
It is an arithmetic number, because the mean of its divisors is an integer number (418613835565).
Almost surely, 23260711148913 is an apocalyptic number.
It is an amenable number.
3260711148913 is a deficient number, since it is larger than the sum of its proper divisors (88199535607).
3260711148913 is a wasteful number, since it uses less digits than its factorization.
3260711148913 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1900227.
The product of its (nonzero) digits is 217728, while the sum is 46.
The spelling of 3260711148913 in words is "three trillion, two hundred sixty billion, seven hundred eleven million, one hundred forty-eight thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •