Base | Representation |
---|---|
bin | 110010100011000011110100… |
… | …000000111100101001001101 |
3 | 1002011010210002201102220121002 |
4 | 302203003310000330221031 |
5 | 213114323124342130221 |
6 | 2104452312322150045 |
7 | 64553324501626562 |
oct | 6243036400745115 |
9 | 1064123081386532 |
10 | 222311601130061 |
11 | 64920903206163 |
12 | 20b255894b2325 |
13 | 9707b81263281 |
14 | 3cc7d20502869 |
15 | 1aa7c7cce380b |
hex | ca30f403ca4d |
222311601130061 has 16 divisors (see below), whose sum is σ = 225960266027520. Its totient is φ = 218677349457840.
The previous prime is 222311601130057. The next prime is 222311601130081. The reversal of 222311601130061 is 160031106113222.
It is a cyclic number.
It is not a de Polignac number, because 222311601130061 - 22 = 222311601130057 is a prime.
It is a super-2 number, since 2×2223116011300612 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222311601130051) 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, 925950650 + ... + 926190708.
It is an arithmetic number, because the mean of its divisors is an integer number (14122516626720).
Almost surely, 2222311601130061 is an apocalyptic number.
It is an amenable number.
222311601130061 is a deficient number, since it is larger than the sum of its proper divisors (3648664897459).
222311601130061 is a wasteful number, since it uses less digits than its factorization.
222311601130061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270016.
The product of its (nonzero) digits is 2592, while the sum is 29.
Adding to 222311601130061 its reverse (160031106113222), we get a palindrome (382342707243283).
The spelling of 222311601130061 in words is "two hundred twenty-two trillion, three hundred eleven billion, six hundred one million, one hundred thirty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.509 sec. • engine limits •