Base | Representation |
---|---|
bin | 111010010111101111100… |
… | …110100001101101011111 |
3 | 112012110200010021022122012 |
4 | 322113233212201231133 |
5 | 1011204441412410333 |
6 | 12310421522341435 |
7 | 562541610223262 |
oct | 72275746415537 |
9 | 15173603238565 |
10 | 4011224341343 |
11 | 130717262842a |
12 | 54949aaba87b |
13 | 23134535082b |
14 | dc203d2acd9 |
15 | 6e51b5b0e48 |
hex | 3a5ef9a1b5f |
4011224341343 has 8 divisors (see below), whose sum is σ = 4222402422000. Its totient is φ = 3800052361728.
The previous prime is 4011224341331. The next prime is 4011224341361. The reversal of 4011224341343 is 3431434221104.
4011224341343 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 4011224341343 - 28 = 4011224341087 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 (4011224344343) 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, 143618 + ... + 2836031.
It is an arithmetic number, because the mean of its divisors is an integer number (527800302750).
Almost surely, 24011224341343 is an apocalyptic number.
4011224341343 is a deficient number, since it is larger than the sum of its proper divisors (211178080657).
4011224341343 is a wasteful number, since it uses less digits than its factorization.
4011224341343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3050521.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 4011224341343 its reverse (3431434221104), we get a palindrome (7442658562447).
The spelling of 4011224341343 in words is "four trillion, eleven billion, two hundred twenty-four million, three hundred forty-one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •