Base | Representation |
---|---|
bin | 100111010011010001100010… |
… | …0101000100110000101011111 |
3 | 1200100000021102022000112220122 |
4 | 1032212203010220212011133 |
5 | 330302343142413242133 |
6 | 3223122500552505155 |
7 | 132546520450524443 |
oct | 11646430450460537 |
9 | 1610007368015818 |
10 | 345696626696543 |
11 | a0171130528951 |
12 | 329323a49ab1bb |
13 | 11ab808a394105 |
14 | 6151b3d980823 |
15 | 29e7568b22498 |
hex | 13a68c4a2615f |
345696626696543 has 8 divisors (see below), whose sum is σ = 361386379022208. Its totient is φ = 330061829721624.
The previous prime is 345696626696503. The next prime is 345696626696563.
345696626696543 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 345696626696543 - 26 = 345696626696479 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (345696626696503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13738824821 + ... + 13738849982.
It is an arithmetic number, because the mean of its divisors is an integer number (45173297377776).
Almost surely, 2345696626696543 is an apocalyptic number.
345696626696543 is a deficient number, since it is larger than the sum of its proper divisors (15689752325665).
345696626696543 is a wasteful number, since it uses less digits than its factorization.
345696626696543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27477675373.
The product of its digits is 27209779200, while the sum is 80.
The spelling of 345696626696543 in words is "three hundred forty-five trillion, six hundred ninety-six billion, six hundred twenty-six million, six hundred ninety-six thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •