Base | Representation |
---|---|
bin | 1111100000110001011111… |
… | …10111110000101001000111 |
3 | 11110210000120110000021012221 |
4 | 13300120233313300221013 |
5 | 13432340203423124033 |
6 | 200314324241553211 |
7 | 10120320055642114 |
oct | 760305767605107 |
9 | 143700513007187 |
10 | 34111433411143 |
11 | a961639971840 |
12 | 39ab036045807 |
13 | 16059046b0b4a |
14 | 85d005ddb90b |
15 | 3e24b3b2112d |
hex | 1f062fdf0a47 |
34111433411143 has 8 divisors (see below), whose sum is σ = 37212524654976. Its totient is φ = 31010350807800.
The previous prime is 34111433411053. The next prime is 34111433411161.
34111433411143 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 a de Polignac number, because none of the positive numbers 2k-34111433411143 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 34111433411099 and 34111433411108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34111433411243) 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, 8294430 + ... + 11705572.
It is an arithmetic number, because the mean of its divisors is an integer number (4651565581872).
Almost surely, 234111433411143 is an apocalyptic number.
34111433411143 is a deficient number, since it is larger than the sum of its proper divisors (3101091243833).
34111433411143 is a wasteful number, since it uses less digits than its factorization.
34111433411143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4320245.
The product of its digits is 20736, while the sum is 34.
It can be divided in two parts, 3411143 and 3411143, that added together give a palindrome (6822286).
The spelling of 34111433411143 in words is "thirty-four trillion, one hundred eleven billion, four hundred thirty-three million, four hundred eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •