Base | Representation |
---|---|
bin | 10011010011111000100… |
… | …011110110010010111100 |
3 | 11200212021022101102212000 |
4 | 103103320203312102330 |
5 | 133220214114333142 |
6 | 2453342525342300 |
7 | 164605536343002 |
oct | 23237043662274 |
9 | 4625238342760 |
10 | 1327020074172 |
11 | 471871266901 |
12 | 195228407990 |
13 | 981a2cb6100 |
14 | 48329d34a72 |
15 | 247bb12314c |
hex | 134f88f64bc |
1327020074172 has 144 divisors (see below), whose sum is σ = 3887404174080. Its totient is φ = 390560968512.
The previous prime is 1327020074167. The next prime is 1327020074179. The reversal of 1327020074172 is 2714700207231.
1327020074172 is a `hidden beast` number, since 1 + 32 + 7 + 0 + 200 + 7 + 417 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1327020074179) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1160758 + ... + 2000349.
It is an arithmetic number, because the mean of its divisors is an integer number (26995862320).
Almost surely, 21327020074172 is an apocalyptic number.
1327020074172 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1327020074172 is an abundant number, since it is smaller than the sum of its proper divisors (2560384099908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1327020074172 is a wasteful number, since it uses less digits than its factorization.
1327020074172 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3161169 (or 3161148 counting only the distinct ones).
The product of its (nonzero) digits is 32928, while the sum is 36.
The spelling of 1327020074172 in words is "one trillion, three hundred twenty-seven billion, twenty million, seventy-four thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •