Base | Representation |
---|---|
bin | 101110111010000000111… |
… | …010101100001110010101 |
3 | 102102011010110211210102121 |
4 | 232322000322230032111 |
5 | 410302444403404031 |
6 | 10504445410535541 |
7 | 451611365553433 |
oct | 56720072541625 |
9 | 12364113753377 |
10 | 3223388341141 |
11 | 1033038759831 |
12 | 44086a2975b1 |
13 | 1a4c6c4c9b97 |
14 | b20272b3d53 |
15 | 58cab137011 |
hex | 2ee80eac395 |
3223388341141 has 4 divisors (see below), whose sum is σ = 3224766448800. Its totient is φ = 3222010233484.
The previous prime is 3223388341111. The next prime is 3223388341211. The reversal of 3223388341141 is 1411438833223.
3223388341141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3223388341141 - 25 = 3223388341109 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 (3223388341111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 689050321 + ... + 689054998.
It is an arithmetic number, because the mean of its divisors is an integer number (806191612200).
Almost surely, 23223388341141 is an apocalyptic number.
It is an amenable number.
3223388341141 is a deficient number, since it is larger than the sum of its proper divisors (1378107659).
3223388341141 is a wasteful number, since it uses less digits than its factorization.
3223388341141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1378107658.
The product of its digits is 331776, while the sum is 43.
The spelling of 3223388341141 in words is "three trillion, two hundred twenty-three billion, three hundred eighty-eight million, three hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •