Base | Representation |
---|---|
bin | 101110111001000010011… |
… | …011101111110100010001 |
3 | 102102001102102021200100112 |
4 | 232321002123233310101 |
5 | 410243323022321001 |
6 | 10504153402131105 |
7 | 451543406300633 |
oct | 56710233576421 |
9 | 12361372250315 |
10 | 3222340042001 |
11 | 103264aa47103 |
12 | 4406171b0a95 |
13 | 1a4b3327b832 |
14 | b1d67d92a53 |
15 | 58c490b4cbb |
hex | 2ee426efd11 |
3222340042001 has 32 divisors (see below), whose sum is σ = 3402455541408. Its totient is φ = 3048528936960.
The previous prime is 3222340041997. The next prime is 3222340042007. The reversal of 3222340042001 is 1002400432223.
It can be written as a sum of positive squares in 16 ways, for example, as 1875869901376 + 1346470140625 = 1369624^2 + 1160375^2 .
It is a cyclic number.
It is not a de Polignac number, because 3222340042001 - 22 = 3222340041997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3222340042007) 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 31 ways as a sum of consecutive naturals, for example, 162923825 + ... + 162943601.
It is an arithmetic number, because the mean of its divisors is an integer number (106326735669).
Almost surely, 23222340042001 is an apocalyptic number.
It is an amenable number.
3222340042001 is a deficient number, since it is larger than the sum of its proper divisors (180115499407).
3222340042001 is a wasteful number, since it uses less digits than its factorization.
3222340042001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20741.
The product of its (nonzero) digits is 2304, while the sum is 23.
Adding to 3222340042001 its reverse (1002400432223), we get a palindrome (4224740474224).
The spelling of 3222340042001 in words is "three trillion, two hundred twenty-two billion, three hundred forty million, forty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •