Base | Representation |
---|---|
bin | 100000010011110100111… |
… | …010100111001010101110 |
3 | 21212021000100222122212211 |
4 | 200103310322213022232 |
5 | 242334144401131342 |
6 | 4415555230321034 |
7 | 316261255466434 |
oct | 40236472471256 |
9 | 7767010878784 |
10 | 2220312130222 |
11 | 7866a135006a |
12 | 2ba38a05917a |
13 | 1314b3b152c4 |
14 | 7966c4a6d54 |
15 | 3cb4e7c5c17 |
hex | 204f4ea72ae |
2220312130222 has 8 divisors (see below), whose sum is σ = 3330484607736. Its totient is φ = 1110150594312.
The previous prime is 2220312130121. The next prime is 2220312130237.
2220312130222 is nontrivially palindromic in base 10.
2220312130222 is digitally balanced in base 2, 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 super-2 number, since 2×22203121302222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2220312130193 and 2220312130202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2207733 + ... + 3052000.
It is an arithmetic number, because the mean of its divisors is an integer number (416310575967).
Almost surely, 22220312130222 is an apocalyptic number.
2220312130222 is a deficient number, since it is larger than the sum of its proper divisors (1110172477514).
2220312130222 is a wasteful number, since it uses less digits than its factorization.
2220312130222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5470802.
The product of its (nonzero) digits is 1152, while the sum is 22.
Multiplying 2220312130222 by its sum of digits (22), we get a palindrome (48846866864884).
The spelling of 2220312130222 in words is "two trillion, two hundred twenty billion, three hundred twelve million, one hundred thirty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •