Base | Representation |
---|---|
bin | 10011001101010110101… |
… | …110111101100010011010 |
3 | 11200012011202220102100012 |
4 | 103031112232331202122 |
5 | 133111340042024010 |
6 | 2450223153441522 |
7 | 164240036546654 |
oct | 23152656754232 |
9 | 4605152812305 |
10 | 1320010111130 |
11 | 4698a4327917 |
12 | 1939b08702a2 |
13 | 97626902399 |
14 | 47c62d436d4 |
15 | 2450a9dc005 |
hex | 13356bbd89a |
1320010111130 has 8 divisors (see below), whose sum is σ = 2376018200052. Its totient is φ = 528004044448.
The previous prime is 1320010111127. The next prime is 1320010111193. The reversal of 1320010111130 is 311110100231.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1294750412641 + 25259698489 = 1137871^2 + 158933^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66000505547 + ... + 66000505566.
Almost surely, 21320010111130 is an apocalyptic number.
1320010111130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1320010111130 is a deficient number, since it is larger than the sum of its proper divisors (1056008088922).
1320010111130 is a wasteful number, since it uses less digits than its factorization.
1320010111130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132001011120.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1320010111130 its reverse (311110100231), we get a palindrome (1631120211361).
It can be divided in two parts, 13200101 and 11130, that added together give a palindrome (13211231).
The spelling of 1320010111130 in words is "one trillion, three hundred twenty billion, ten million, one hundred eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •