Base | Representation |
---|---|
bin | 110001101100110111110… |
… | …111101011111100110111 |
3 | 110002111211122001020010201 |
4 | 301230313313223330313 |
5 | 421424303201021033 |
6 | 11133010234101331 |
7 | 501520460632564 |
oct | 61546767537467 |
9 | 13074748036121 |
10 | 3415436345143 |
11 | 10a752985a709 |
12 | 471b2687a847 |
13 | 1ba0c7212984 |
14 | bb44522586b |
15 | 5dc9b3e447d |
hex | 31b37debf37 |
3415436345143 has 4 divisors (see below), whose sum is σ = 3415653393120. Its totient is φ = 3415219297168.
The previous prime is 3415436345093. The next prime is 3415436345149.
It is a happy number.
3415436345143 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3415436345143 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3415436345093 and 3415436345102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3415436345149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 108500383 + ... + 108531856.
It is an arithmetic number, because the mean of its divisors is an integer number (853913348280).
Almost surely, 23415436345143 is an apocalyptic number.
3415436345143 is a deficient number, since it is larger than the sum of its proper divisors (217047977).
3415436345143 is a wasteful number, since it uses less digits than its factorization.
3415436345143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217047976.
The product of its digits is 3110400, while the sum is 46.
The spelling of 3415436345143 in words is "three trillion, four hundred fifteen billion, four hundred thirty-six million, three hundred forty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •