Base | Representation |
---|---|
bin | 101110111001101011001… |
… | …101101011101111000001 |
3 | 102102010012002200120122221 |
4 | 232321223031223233001 |
5 | 410301223200033441 |
6 | 10504345322331041 |
7 | 451566354600145 |
oct | 56715315535701 |
9 | 12363162616587 |
10 | 3223024221121 |
11 | 103297116aaa1 |
12 | 440788359a81 |
13 | 1a4c11c3ba53 |
14 | b1dd0bad225 |
15 | 58c891ae8d1 |
hex | 2ee6b36bbc1 |
3223024221121 has 8 divisors (see below), whose sum is σ = 3372588325224. Its totient is φ = 3076747240320.
The previous prime is 3223024221103. The next prime is 3223024221149. The reversal of 3223024221121 is 1211224203223.
It can be written as a sum of positive squares in 4 ways, for example, as 494131673025 + 2728892548096 = 702945^2 + 1651936^2 .
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 3223024221121 - 29 = 3223024220609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3223024221721) 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, 821778820 + ... + 821782741.
It is an arithmetic number, because the mean of its divisors is an integer number (421573540653).
Almost surely, 23223024221121 is an apocalyptic number.
It is an amenable number.
3223024221121 is a deficient number, since it is larger than the sum of its proper divisors (149564104103).
3223024221121 is a wasteful number, since it uses less digits than its factorization.
3223024221121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1643561651.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 3223024221121 its reverse (1211224203223), we get a palindrome (4434248424344).
The spelling of 3223024221121 in words is "three trillion, two hundred twenty-three billion, twenty-four million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •