Base | Representation |
---|---|
bin | 10011001110010111110… |
… | …101000111010111100101 |
3 | 11200021222212221111000212 |
4 | 103032113311013113211 |
5 | 133121104133241201 |
6 | 2450523405545205 |
7 | 164306100533531 |
oct | 23162765072745 |
9 | 4607885844025 |
10 | 1321102243301 |
11 | 46a304858995 |
12 | 194056575205 |
13 | 9776bc59b39 |
14 | 47d27dd4bc1 |
15 | 2457181babb |
hex | 13397d475e5 |
1321102243301 has 8 divisors (see below), whose sum is σ = 1372102351200. Its totient is φ = 1270465126000.
The previous prime is 1321102243297. The next prime is 1321102243427. The reversal of 1321102243301 is 1033422011231.
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 1321102243301 - 22 = 1321102243297 is a prime.
It is a super-2 number, since 2×13211022433012 (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 (1321102243801) 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, 90740231 + ... + 90754788.
It is an arithmetic number, because the mean of its divisors is an integer number (171512793900).
Almost surely, 21321102243301 is an apocalyptic number.
It is an amenable number.
1321102243301 is a deficient number, since it is larger than the sum of its proper divisors (51000107899).
1321102243301 is a wasteful number, since it uses less digits than its factorization.
1321102243301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181495299.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1321102243301 its reverse (1033422011231), we get a palindrome (2354524254532).
The spelling of 1321102243301 in words is "one trillion, three hundred twenty-one billion, one hundred two million, two hundred forty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •