Base | Representation |
---|---|
bin | 10011001110011110110… |
… | …110101101000000010001 |
3 | 11200022022002201020011222 |
4 | 103032132312231000101 |
5 | 133121324321200423 |
6 | 2450543220014425 |
7 | 164312031360434 |
oct | 23163666550021 |
9 | 4608262636158 |
10 | 1321220100113 |
11 | 46a365336511 |
12 | 194089b31415 |
13 | 9778a4b33b4 |
14 | 47d3991381b |
15 | 2457bd4c3c8 |
hex | 1339edad011 |
1321220100113 has 16 divisors (see below), whose sum is σ = 1385802712320. Its totient is φ = 1257913286784.
The previous prime is 1321220100041. The next prime is 1321220100119. The reversal of 1321220100113 is 3110010221231.
It is a cyclic number.
It is not a de Polignac number, because 1321220100113 - 222 = 1321215905809 is a prime.
It is a super-2 number, since 2×13212201001132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1321220100091 and 1321220100100.
It is not an unprimeable number, because it can be changed into a prime (1321220100119) 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, 10060370 + ... + 10190852.
It is an arithmetic number, because the mean of its divisors is an integer number (86612669520).
Almost surely, 21321220100113 is an apocalyptic number.
It is an amenable number.
1321220100113 is a deficient number, since it is larger than the sum of its proper divisors (64582612207).
1321220100113 is a wasteful number, since it uses less digits than its factorization.
1321220100113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135368.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1321220100113 its reverse (3110010221231), we get a palindrome (4431230321344).
The spelling of 1321220100113 in words is "one trillion, three hundred twenty-one billion, two hundred twenty million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •