Base | Representation |
---|---|
bin | 10001110001010110011… |
… | …100011100111101101110 |
3 | 11022202011222210011212022 |
4 | 101301112130130331232 |
5 | 130002030034330220 |
6 | 2333004324310142 |
7 | 154141665215456 |
oct | 21612634347556 |
9 | 4282158704768 |
10 | 1221221011310 |
11 | 430a0a472a73 |
12 | 178820542352 |
13 | 8b211c32631 |
14 | 43170a4cd66 |
15 | 21b77c42925 |
hex | 11c5671cf6e |
1221221011310 has 8 divisors (see below), whose sum is σ = 2198197820376. Its totient is φ = 488488404520.
The previous prime is 1221221011279. The next prime is 1221221011369. The reversal of 1221221011310 is 131101221221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×12212210113102 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 61061050556 + ... + 61061050575.
It is an arithmetic number, because the mean of its divisors is an integer number (274774727547).
Almost surely, 21221221011310 is an apocalyptic number.
1221221011310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1221221011310 is a deficient number, since it is larger than the sum of its proper divisors (976976809066).
1221221011310 is a wasteful number, since it uses less digits than its factorization.
1221221011310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122122101138.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1221221011310 its reverse (131101221221), we get a palindrome (1352322232531).
The spelling of 1221221011310 in words is "one trillion, two hundred twenty-one billion, two hundred twenty-one million, eleven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •