Base | Representation |
---|---|
bin | 10011011000101101010… |
… | …111111011101001110010 |
3 | 11201100122101102100001200 |
4 | 103120231113323221302 |
5 | 133311321441011010 |
6 | 2500001005112030 |
7 | 165151120412052 |
oct | 23305527735162 |
9 | 4640571370050 |
10 | 1332201110130 |
11 | 473a8a883900 |
12 | 196233558616 |
13 | 9881a4bc267 |
14 | 4869c07d562 |
15 | 249c0dd9cc0 |
hex | 1362d5fba72 |
1332201110130 has 72 divisors (see below), whose sum is σ = 3807232625196. Its totient is φ = 322957842240.
The previous prime is 1332201110087. The next prime is 1332201110143. The reversal of 1332201110130 is 310111022331.
1332201110130 is a `hidden beast` number, since 1 + 332 + 201 + 1 + 1 + 0 + 130 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1331662916529 + 538193601 = 1153977^2 + 23199^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 61155369 + ... + 61177148.
Almost surely, 21332201110130 is an apocalyptic number.
1332201110130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1332201110130 is an abundant number, since it is smaller than the sum of its proper divisors (2475031515066).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1332201110130 is a wasteful number, since it uses less digits than its factorization.
1332201110130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122332552 (or 122332538 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1332201110130 its reverse (310111022331), we get a palindrome (1642312132461).
The spelling of 1332201110130 in words is "one trillion, three hundred thirty-two billion, two hundred one million, one hundred ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •