Base | Representation |
---|---|
bin | 101101001100010111010… |
… | …100010011011111100001 |
3 | 101222220020021012002122110 |
4 | 231030113110103133201 |
5 | 401340334023204242 |
6 | 10334414520225533 |
7 | 440242652101011 |
oct | 55142724233741 |
9 | 11886207162573 |
10 | 3105652553697 |
11 | a981109a2061 |
12 | 421a9090b2a9 |
13 | 196b28437675 |
14 | aa458961c41 |
15 | 55bb9d3439c |
hex | 2d3175137e1 |
3105652553697 has 8 divisors (see below), whose sum is σ = 4358810601760. Its totient is φ = 1961464770720.
The previous prime is 3105652553693. The next prime is 3105652553713. The reversal of 3105652553697 is 7963552565013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3105652553697 - 22 = 3105652553693 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57), and also a Moran number because the ratio is a prime number: 54485132521 = 3105652553697 / (3 + 1 + 0 + 5 + 6 + 5 + 2 + 5 + 5 + 3 + 6 + 9 + 7).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3105652553693) 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, 27242566204 + ... + 27242566317.
It is an arithmetic number, because the mean of its divisors is an integer number (544851325220).
Almost surely, 23105652553697 is an apocalyptic number.
It is an amenable number.
3105652553697 is a deficient number, since it is larger than the sum of its proper divisors (1253158048063).
3105652553697 is a wasteful number, since it uses less digits than its factorization.
3105652553697 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54485132543.
The product of its (nonzero) digits is 25515000, while the sum is 57.
The spelling of 3105652553697 in words is "three trillion, one hundred five billion, six hundred fifty-two million, five hundred fifty-three thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •