Base | Representation |
---|---|
bin | 10001110001100001000… |
… | …111011001011100000101 |
3 | 11022202122110122211201202 |
4 | 101301201013121130011 |
5 | 130002411402304341 |
6 | 2333034201432245 |
7 | 154146301023533 |
oct | 21614107313405 |
9 | 4282573584652 |
10 | 1221400041221 |
11 | 430aa1532878 |
12 | 17887049b685 |
13 | 8b240056aa9 |
14 | 4318a733153 |
15 | 21b8880879b |
hex | 11c611d9705 |
1221400041221 has 8 divisors (see below), whose sum is σ = 1222071681024. Its totient is φ = 1220728566640.
The previous prime is 1221400041107. The next prime is 1221400041223.
1221400041221 is nontrivially palindromic in base 10.
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 1221400041221 - 226 = 1221332932357 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1221400041193 and 1221400041202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221400041223) 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, 16529660 + ... + 16603386.
It is an arithmetic number, because the mean of its divisors is an integer number (152758960128).
Almost surely, 21221400041221 is an apocalyptic number.
It is an amenable number.
1221400041221 is a deficient number, since it is larger than the sum of its proper divisors (671639803).
1221400041221 is an equidigital number, since it uses as much as digits as its factorization.
1221400041221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82611.
The product of its (nonzero) digits is 256, while the sum is 20.
It can be divided in two parts, 12214000 and 41221, that added together give a palindrome (12255221).
The spelling of 1221400041221 in words is "one trillion, two hundred twenty-one billion, four hundred million, forty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •