Base | Representation |
---|---|
bin | 101011111110100011010… |
… | …101011101100000111101 |
3 | 101200220120111200112020111 |
4 | 223332203111131200331 |
5 | 344003231143234323 |
6 | 10232200140550021 |
7 | 431224340613253 |
oct | 53764325354075 |
9 | 11626514615214 |
10 | 3022102321213 |
11 | a65736a79848 |
12 | 409853b52311 |
13 | 18bca1929091 |
14 | a63b04b05d3 |
15 | 53929d34c0d |
hex | 2bfa355d83d |
3022102321213 has 8 divisors (see below), whose sum is σ = 3028457257560. Its totient is φ = 3015753810240.
The previous prime is 3022102321169. The next prime is 3022102321267. The reversal of 3022102321213 is 3121232012203.
It can be written as a sum of positive squares in 4 ways, for example, as 211845711289 + 2810256609924 = 460267^2 + 1676382^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 3022102321213 - 237 = 2884663367741 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 (3022102321013) 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, 664098 + ... + 2546611.
It is an arithmetic number, because the mean of its divisors is an integer number (378557157195).
Almost surely, 23022102321213 is an apocalyptic number.
It is an amenable number.
3022102321213 is a deficient number, since it is larger than the sum of its proper divisors (6354936347).
3022102321213 is a wasteful number, since it uses less digits than its factorization.
3022102321213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3212687.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 3022102321213 its reverse (3121232012203), we get a palindrome (6143334333416).
The spelling of 3022102321213 in words is "three trillion, twenty-two billion, one hundred two million, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •