Base | Representation |
---|---|
bin | 10011100001000001000… |
… | …000011100010011011001 |
3 | 11202012122222200210112222 |
4 | 103201001000130103121 |
5 | 133433103312300241 |
6 | 2504034025113425 |
7 | 165615133401656 |
oct | 23410100342331 |
9 | 4665588623488 |
10 | 1341120431321 |
11 | 47784757a930 |
12 | 197b02628875 |
13 | 9960c3321c8 |
14 | 48ca6892c2d |
15 | 24d43e7ba4b |
hex | 1384101c4d9 |
1341120431321 has 16 divisors (see below), whose sum is σ = 1540106039040. Its totient is φ = 1154984371920.
The previous prime is 1341120431317. The next prime is 1341120431341. The reversal of 1341120431321 is 1231340211431.
It is a cyclic number.
It is not a de Polignac number, because 1341120431321 - 22 = 1341120431317 is a prime.
It is a super-2 number, since 2×13411204313212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1341120431341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5533346 + ... + 5770628.
It is an arithmetic number, because the mean of its divisors is an integer number (96256627440).
Almost surely, 21341120431321 is an apocalyptic number.
1341120431321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1341120431321 is a deficient number, since it is larger than the sum of its proper divisors (198985607719).
1341120431321 is a wasteful number, since it uses less digits than its factorization.
1341120431321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264356.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 1341120431321 its reverse (1231340211431), we get a palindrome (2572460642752).
The spelling of 1341120431321 in words is "one trillion, three hundred forty-one billion, one hundred twenty million, four hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •