Base | Representation |
---|---|
bin | 101011111110100011111… |
… | …111000101100011001101 |
3 | 101200220121021012220112111 |
4 | 223332203333011203031 |
5 | 344003241441424401 |
6 | 10232201210504021 |
7 | 431224532431324 |
oct | 53764377054315 |
9 | 11626537186474 |
10 | 3022113233101 |
11 | a65742152036 |
12 | 409857735011 |
13 | 18bca3c79a11 |
14 | a63b1b110bb |
15 | 5392ac8ce51 |
hex | 2bfa3fc58cd |
3022113233101 has 8 divisors (see below), whose sum is σ = 3200984646840. Its totient is φ = 2843364046848.
The previous prime is 3022113233053. The next prime is 3022113233131. The reversal of 3022113233101 is 1013323112203.
It can be written as a sum of positive squares in 4 ways, for example, as 574906667076 + 2447206566025 = 758226^2 + 1564355^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 3022113233101 - 213 = 3022113224909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3022113233131) 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, 30505956 + ... + 30604861.
It is an arithmetic number, because the mean of its divisors is an integer number (400123080855).
Almost surely, 23022113233101 is an apocalyptic number.
It is an amenable number.
3022113233101 is a deficient number, since it is larger than the sum of its proper divisors (178871413739).
3022113233101 is a wasteful number, since it uses less digits than its factorization.
3022113233101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61113743.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 3022113233101 its reverse (1013323112203), we get a palindrome (4035436345304).
The spelling of 3022113233101 in words is "three trillion, twenty-two billion, one hundred thirteen million, two hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •