Base | Representation |
---|---|
bin | 10011101100010010010… |
… | …110010111101010011111 |
3 | 11210100220101222020110001 |
4 | 103230102112113222133 |
5 | 134132344433132343 |
6 | 2513354543355131 |
7 | 166524054623203 |
oct | 23542226275237 |
9 | 4710811866401 |
10 | 1353222552223 |
11 | 481997941443 |
12 | 19a31b5b2aa7 |
13 | 9a7ba6a09a9 |
14 | 496d3c94b03 |
15 | 2530167044d |
hex | 13b12597a9f |
1353222552223 has 16 divisors (see below), whose sum is σ = 1392580344960. Its totient is φ = 1314169747200.
The previous prime is 1353222552181. The next prime is 1353222552239. The reversal of 1353222552223 is 3222552223531.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1353222552223 is a prime.
It is a super-2 number, since 2×13532225522232 (a number of 25 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 (1353222552263) 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 15 ways as a sum of consecutive naturals, for example, 53607961 + ... + 53633197.
It is an arithmetic number, because the mean of its divisors is an integer number (87036271560).
Almost surely, 21353222552223 is an apocalyptic number.
1353222552223 is a deficient number, since it is larger than the sum of its proper divisors (39357792737).
1353222552223 is a wasteful number, since it uses less digits than its factorization.
1353222552223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31218.
The product of its digits is 216000, while the sum is 37.
Adding to 1353222552223 its reverse (3222552223531), we get a palindrome (4575774775754).
The spelling of 1353222552223 in words is "one trillion, three hundred fifty-three billion, two hundred twenty-two million, five hundred fifty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •