Base | Representation |
---|---|
bin | 100111001110011011101001… |
… | …1110010111010111000101111 |
3 | 1200020122122201212011011121211 |
4 | 1032130313103302322320233 |
5 | 330210442304222134133 |
6 | 3221453043252135251 |
7 | 132450451550534116 |
oct | 11634672362727057 |
9 | 1606578655134554 |
10 | 345031161130543 |
11 | 9aa349915726a8 |
12 | 32845425907527 |
13 | 11a6a3b6861004 |
14 | 612b850dd4c7d |
15 | 29d50bb7d4bcd |
hex | 139cdd3cbae2f |
345031161130543 has 8 divisors (see below), whose sum is σ = 345394032530096. Its totient is φ = 344668345560000.
The previous prime is 345031161130531. The next prime is 345031161130559.
345031161130543 is nontrivially palindromic in base 10.
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 345031161130543 - 29 = 345031161130031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 345031161130496 and 345031161130505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (345031161130343) 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, 1584708 + ... + 26316793.
It is an arithmetic number, because the mean of its divisors is an integer number (43174254066262).
Almost surely, 2345031161130543 is an apocalyptic number.
345031161130543 is a deficient number, since it is larger than the sum of its proper divisors (362871399553).
345031161130543 is a wasteful number, since it uses less digits than its factorization.
345031161130543 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27914505.
The product of its (nonzero) digits is 194400, while the sum is 40.
The spelling of 345031161130543 in words is "three hundred forty-five trillion, thirty-one billion, one hundred sixty-one million, one hundred thirty thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •