Base | Representation |
---|---|
bin | 10011001101010111011… |
… | …000100111010011100001 |
3 | 11200012012112110011100222 |
4 | 103031113120213103201 |
5 | 133111400340430423 |
6 | 2450224223452425 |
7 | 164240231424512 |
oct | 23152730472341 |
9 | 4605175404328 |
10 | 1320021030113 |
11 | 4698aa505475 |
12 | 1939b4457115 |
13 | 97628c56316 |
14 | 47c64586a09 |
15 | 2450b9473c8 |
hex | 133576274e1 |
1320021030113 has 12 divisors (see below), whose sum is σ = 1434847046160. Its totient is φ = 1213480333632.
The previous prime is 1320021030101. The next prime is 1320021030149. The reversal of 1320021030113 is 3110301200231.
It is a de Polignac number, because none of the positive numbers 2k-1320021030113 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1320021030091 and 1320021030100.
It is not an unprimeable number, because it can be changed into a prime (1320021080113) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 53098583 + ... + 53123436.
It is an arithmetic number, because the mean of its divisors is an integer number (119570587180).
Almost surely, 21320021030113 is an apocalyptic number.
It is an amenable number.
1320021030113 is a deficient number, since it is larger than the sum of its proper divisors (114826016047).
1320021030113 is a wasteful number, since it uses less digits than its factorization.
1320021030113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106222096 (or 106222079 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1320021030113 its reverse (3110301200231), we get a palindrome (4430322230344).
The spelling of 1320021030113 in words is "one trillion, three hundred twenty billion, twenty-one million, thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •