Base | Representation |
---|---|
bin | 11110000010100000111100… |
… | …000001010110101110000000 |
3 | 122022202222211211012200201111 |
4 | 132002200330001112232000 |
5 | 114304024340424404440 |
6 | 1144552232011013104 |
7 | 36553636026620614 |
oct | 3602407401265600 |
9 | 568688754180644 |
10 | 132114201013120 |
11 | 39106355297497 |
12 | 1299874a73a194 |
13 | 5894414788321 |
14 | 248a50bb4d344 |
15 | 10418d839d4ea |
hex | 78283c056b80 |
132114201013120 has 64 divisors (see below), whose sum is σ = 315837013273200. Its totient is φ = 52845429178368.
The previous prime is 132114201013079. The next prime is 132114201013139. The reversal of 132114201013120 is 21310102411231.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 132114201013091 and 132114201013100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 195103291 + ... + 195779269.
Almost surely, 2132114201013120 is an apocalyptic number.
132114201013120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132114201013120 is an abundant number, since it is smaller than the sum of its proper divisors (183722812260080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132114201013120 is an equidigital number, since it uses as much as digits as its factorization.
132114201013120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 981375 (or 981363 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 132114201013120 its reverse (21310102411231), we get a palindrome (153424303424351).
The spelling of 132114201013120 in words is "one hundred thirty-two trillion, one hundred fourteen billion, two hundred one million, thirteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •