Base | Representation |
---|---|
bin | 110010100001011100110011… |
… | …110011001111101110011011 |
3 | 1002010202012121212220121001211 |
4 | 302201130303303033232123 |
5 | 213111020123021132311 |
6 | 2104325421533523551 |
7 | 64542330654634330 |
oct | 6241346363175633 |
9 | 1063665555817054 |
10 | 222201002130331 |
11 | 64888a08a30754 |
12 | 20b080620435b7 |
13 | 96ca60692ab73 |
14 | 3cc282b956987 |
15 | 1aa4e58329821 |
hex | ca1733ccfb9b |
222201002130331 has 8 divisors (see below), whose sum is σ = 254550074042880. Its totient is φ = 190003448119848.
The previous prime is 222201002130299. The next prime is 222201002130403. The reversal of 222201002130331 is 133031200102222.
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 222201002130331 - 25 = 222201002130299 is a prime.
It is a super-2 number, since 2×2222010021303312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (222201002139331) 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, 37879472371 + ... + 37879478236.
It is an arithmetic number, because the mean of its divisors is an integer number (31818759255360).
Almost surely, 2222201002130331 is an apocalyptic number.
222201002130331 is a deficient number, since it is larger than the sum of its proper divisors (32349071912549).
222201002130331 is an equidigital number, since it uses as much as digits as its factorization.
222201002130331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75758951033.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 222201002130331 its reverse (133031200102222), we get a palindrome (355232202232553).
The spelling of 222201002130331 in words is "two hundred twenty-two trillion, two hundred one billion, two million, one hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •