Base | Representation |
---|---|
bin | 10010111011111100000… |
… | …111101111011101010101 |
3 | 11121101220112100220210021 |
4 | 102323330013233131111 |
5 | 132310040330324341 |
6 | 2433451421425141 |
7 | 163005450406153 |
oct | 22737407573525 |
9 | 4541815326707 |
10 | 1301310011221 |
11 | 461978637aa0 |
12 | 19025210b1b1 |
13 | 959366290cc |
14 | 46dab5543d3 |
15 | 23cb3e419d1 |
hex | 12efc1ef755 |
1301310011221 has 16 divisors (see below), whose sum is σ = 1427184665280. Its totient is φ = 1176714334080.
The previous prime is 1301310011219. The next prime is 1301310011251. The reversal of 1301310011221 is 1221100131031.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1301310011221 - 21 = 1301310011219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1301310011195 and 1301310011204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301310011251) 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, 1144375 + ... + 1977931.
It is an arithmetic number, because the mean of its divisors is an integer number (89199041580).
Almost surely, 21301310011221 is an apocalyptic number.
1301310011221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1301310011221 is a deficient number, since it is larger than the sum of its proper divisors (125874654059).
1301310011221 is a wasteful number, since it uses less digits than its factorization.
1301310011221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 834324.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1301310011221 its reverse (1221100131031), we get a palindrome (2522410142252).
The spelling of 1301310011221 in words is "one trillion, three hundred one billion, three hundred ten million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •