Base | Representation |
---|---|
bin | 101110111001000001110… |
… | …110101000100110001101 |
3 | 102102001101201222101210220 |
4 | 232321001312220212031 |
5 | 410243313030004401 |
6 | 10504152413421553 |
7 | 451543230510534 |
oct | 56710166504615 |
9 | 12361351871726 |
10 | 3222330313101 |
11 | 1032645501699 |
12 | 440613a9a8b9 |
13 | 1a4b312534a3 |
14 | b1d6697d31b |
15 | 58c482e2336 |
hex | 2ee41da898d |
3222330313101 has 8 divisors (see below), whose sum is σ = 4296726316224. Its totient is φ = 2148077259360.
The previous prime is 3222330313091. The next prime is 3222330313159. The reversal of 3222330313101 is 1013130332223.
3222330313101 is digitally balanced in base 2 and base 3, because in such bases 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 not a de Polignac number, because 3222330313101 - 213 = 3222330304909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3222330313901) 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, 35684736 + ... + 35774921.
It is an arithmetic number, because the mean of its divisors is an integer number (537090789528).
Almost surely, 23222330313101 is an apocalyptic number.
It is an amenable number.
3222330313101 is a deficient number, since it is larger than the sum of its proper divisors (1074396003123).
3222330313101 is a wasteful number, since it uses less digits than its factorization.
3222330313101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71474691.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 3222330313101 its reverse (1013130332223), we get a palindrome (4235460645324).
The spelling of 3222330313101 in words is "three trillion, two hundred twenty-two billion, three hundred thirty million, three hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •