Base | Representation |
---|---|
bin | 110010100000011101011110… |
… | …101000101010110011001101 |
3 | 1002010111201002210100120001122 |
4 | 302200131132220222303031 |
5 | 213103411341313114242 |
6 | 2104234254140050325 |
7 | 64534402564264220 |
oct | 6240353650526315 |
9 | 1063451083316048 |
10 | 222133001301197 |
11 | 6486209326a308 |
12 | 20ab6a448339a5 |
13 | 96c408a72a36c |
14 | 3cbd41a6615b7 |
15 | 1aa32c84b5ad2 |
hex | ca075ea2accd |
222133001301197 has 16 divisors (see below), whose sum is σ = 260176195880832. Its totient is φ = 185671499892480.
The previous prime is 222133001301121. The next prime is 222133001301227. The reversal of 222133001301197 is 791103100331222.
222133001301197 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 222133001301197 - 28 = 222133001300941 is a prime.
It is a super-2 number, since 2×2221330013011972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222133001301997) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 175033328 + ... + 176297849.
It is an arithmetic number, because the mean of its divisors is an integer number (16261012242552).
Almost surely, 2222133001301197 is an apocalyptic number.
It is an amenable number.
222133001301197 is a deficient number, since it is larger than the sum of its proper divisors (38043194579635).
222133001301197 is a wasteful number, since it uses less digits than its factorization.
222133001301197 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 351333428.
The product of its (nonzero) digits is 13608, while the sum is 35.
The spelling of 222133001301197 in words is "two hundred twenty-two trillion, one hundred thirty-three billion, one million, three hundred one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •