Base | Representation |
---|---|
bin | 101011111110101010011… |
… | …010111101001110001001 |
3 | 101200220212210101022110012 |
4 | 223332222122331032021 |
5 | 344004002111433223 |
6 | 10232220025001305 |
7 | 431230313234345 |
oct | 53765232751611 |
9 | 11626783338405 |
10 | 3022221202313 |
11 | a65798096995 |
12 | 409887923235 |
13 | 18bcc0450921 |
14 | a63c21b8625 |
15 | 539354b8c78 |
hex | 2bfaa6bd389 |
3022221202313 has 8 divisors (see below), whose sum is σ = 3067415546880. Its totient is φ = 2977029403920.
The previous prime is 3022221202223. The next prime is 3022221202321. The reversal of 3022221202313 is 3132021222203.
3022221202313 is digitally balanced in base 3, because in such base 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 a cyclic number.
It is not a de Polignac number, because 3022221202313 - 218 = 3022220940169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3022221202513) 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, 1825823 + ... + 3062363.
It is an arithmetic number, because the mean of its divisors is an integer number (383426943360).
Almost surely, 23022221202313 is an apocalyptic number.
It is an amenable number.
3022221202313 is a deficient number, since it is larger than the sum of its proper divisors (45194344567).
3022221202313 is a wasteful number, since it uses less digits than its factorization.
3022221202313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1273087.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 3022221202313 its reverse (3132021222203), we get a palindrome (6154242424516).
The spelling of 3022221202313 in words is "three trillion, twenty-two billion, two hundred twenty-one million, two hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •