Base | Representation |
---|---|
bin | 110010011110111101100101… |
… | …001001010011000101101011 |
3 | 1002010010212022122010200020102 |
4 | 302132331211021103011223 |
5 | 213100220001003144034 |
6 | 2104115104355420015 |
7 | 64524066104610002 |
oct | 6236754511230553 |
9 | 1063125278120212 |
10 | 222030031303019 |
11 | 648224533a5665 |
12 | 20a9aaa82b460b |
13 | 96b745a80c164 |
14 | 3cb844cda7c39 |
15 | 1aa079d66197e |
hex | c9ef6525316b |
222030031303019 has 4 divisors (see below), whose sum is σ = 222032487559344. Its totient is φ = 222027575046696.
The previous prime is 222030031303013. The next prime is 222030031303057. The reversal of 222030031303019 is 910303130030222.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 222030031303019 - 28 = 222030031302763 is a prime.
It is a super-2 number, since 2×2220300313030192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 222030031302982 and 222030031303000.
It is not an unprimeable number, because it can be changed into a prime (222030031303013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1227992567 + ... + 1228173360.
It is an arithmetic number, because the mean of its divisors is an integer number (55508121889836).
Almost surely, 2222030031303019 is an apocalyptic number.
222030031303019 is a deficient number, since it is larger than the sum of its proper divisors (2456256325).
222030031303019 is an equidigital number, since it uses as much as digits as its factorization.
222030031303019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2456256324.
The product of its (nonzero) digits is 5832, while the sum is 29.
The spelling of 222030031303019 in words is "two hundred twenty-two trillion, thirty billion, thirty-one million, three hundred three thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •