Base | Representation |
---|---|
bin | 10001110010100101101… |
… | …111100011110101010011 |
3 | 11022212121201011221211020 |
4 | 101302211233203311103 |
5 | 130012241130421433 |
6 | 2333344331450523 |
7 | 154216651416636 |
oct | 21624557436523 |
9 | 4285551157736 |
10 | 1222551420243 |
11 | 43153244a98a |
12 | 178b31bb6a43 |
13 | 8b39475675a |
14 | 43259607c1d |
15 | 21c0493ccb3 |
hex | 11ca5be3d53 |
1222551420243 has 8 divisors (see below), whose sum is σ = 1669826330256. Its totient is φ = 795155395200.
The previous prime is 1222551420227. The next prime is 1222551420247. The reversal of 1222551420243 is 3420241552221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1222551420243 - 24 = 1222551420227 is a prime.
It is a super-3 number, since 3×12225514202433 (a number of 37 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1222551420247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4969721098 + ... + 4969721343.
It is an arithmetic number, because the mean of its divisors is an integer number (208728291282).
Almost surely, 21222551420243 is an apocalyptic number.
1222551420243 is a deficient number, since it is larger than the sum of its proper divisors (447274910013).
1222551420243 is an equidigital number, since it uses as much as digits as its factorization.
1222551420243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9939442485.
The product of its (nonzero) digits is 38400, while the sum is 33.
Adding to 1222551420243 its reverse (3420241552221), we get a palindrome (4642792972464).
The spelling of 1222551420243 in words is "one trillion, two hundred twenty-two billion, five hundred fifty-one million, four hundred twenty thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •