Base | Representation |
---|---|
bin | 1010000110000111010101… |
… | …10011000100010001001111 |
3 | 2220121022221012000000202012 |
4 | 11003003222303010101033 |
5 | 10402212234020203403 |
6 | 115114405123251435 |
7 | 4450630610335010 |
oct | 503035263042117 |
9 | 86538835000665 |
10 | 22200330241103 |
11 | 708a11a729053 |
12 | 25a66a5819b7b |
13 | c506363c29c1 |
14 | 56a7049d5007 |
15 | 2877352bbed8 |
hex | 1430eacc444f |
22200330241103 has 8 divisors (see below), whose sum is σ = 25371869435808. Its totient is φ = 19028806907904.
The previous prime is 22200330241057. The next prime is 22200330241123. The reversal of 22200330241103 is 30114203300222.
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 22200330241103 - 226 = 22200263132239 is a prime.
It is a super-2 number, since 2×222003302411032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22200330241123) 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, 797426 + ... + 6710927.
It is an arithmetic number, because the mean of its divisors is an integer number (3171483679476).
Almost surely, 222200330241103 is an apocalyptic number.
22200330241103 is a deficient number, since it is larger than the sum of its proper divisors (3171539194705).
22200330241103 is an equidigital number, since it uses as much as digits as its factorization.
22200330241103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7930753.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 22200330241103 its reverse (30114203300222), we get a palindrome (52314533541325).
The spelling of 22200330241103 in words is "twenty-two trillion, two hundred billion, three hundred thirty million, two hundred forty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •