Base | Representation |
---|---|
bin | 11110000010101000010100… |
… | …001101011000100000001110 |
3 | 122022210202021220211221100111 |
4 | 132002220110031120200032 |
5 | 114304142101442341420 |
6 | 1145000022042550234 |
7 | 36554336242531600 |
oct | 3602502415304016 |
9 | 568722256757314 |
10 | 132122123012110 |
11 | 391097500295a0 |
12 | 1299a19b80837a |
13 | 58950a7ababaa |
14 | 248aa5dd11170 |
15 | 1041bedadc45a |
hex | 782a1435880e |
132122123012110 has 96 divisors (see below), whose sum is σ = 304727396792832. Its totient is φ = 40781106515520.
The previous prime is 132122123012069. The next prime is 132122123012137. The reversal of 132122123012110 is 11210321221231.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 118437322 + ... + 119547661.
It is an arithmetic number, because the mean of its divisors is an integer number (3174243716592).
Almost surely, 2132122123012110 is an apocalyptic number.
132122123012110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132122123012110 is an abundant number, since it is smaller than the sum of its proper divisors (172605273780722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132122123012110 is a wasteful number, since it uses less digits than its factorization.
132122123012110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 237985118 (or 237985111 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 132122123012110 its reverse (11210321221231), we get a palindrome (143332444233341).
The spelling of 132122123012110 in words is "one hundred thirty-two trillion, one hundred twenty-two billion, one hundred twenty-three million, twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •