Base | Representation |
---|---|
bin | 11110000001100000111001… |
… | …101011000111001001111000 |
3 | 122022112102100220021120222201 |
4 | 132001200321223013021320 |
5 | 114301413031142313112 |
6 | 1144500501053555544 |
7 | 36545653103134054 |
oct | 3601407153071170 |
9 | 568472326246881 |
10 | 132045442151032 |
11 | 3908a180749733 |
12 | 1298735b4a5bb4 |
13 | 588aaa7509907 |
14 | 2487067cd4c64 |
15 | 103ec11c02257 |
hex | 781839ac7278 |
132045442151032 has 8 divisors (see below), whose sum is σ = 247585204033200. Its totient is φ = 66022721075512.
The previous prime is 132045442150927. The next prime is 132045442151033. The reversal of 132045442151032 is 230151244540231.
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 132045442150982 and 132045442151000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132045442151033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8252840134432 + ... + 8252840134447.
It is an arithmetic number, because the mean of its divisors is an integer number (30948150504150).
Almost surely, 2132045442151032 is an apocalyptic number.
It is an amenable number.
132045442151032 is a deficient number, since it is larger than the sum of its proper divisors (115539761882168).
132045442151032 is a wasteful number, since it uses less digits than its factorization.
132045442151032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16505680268885 (or 16505680268881 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 37.
Adding to 132045442151032 its reverse (230151244540231), we get a palindrome (362196686691263).
The spelling of 132045442151032 in words is "one hundred thirty-two trillion, forty-five billion, four hundred forty-two million, one hundred fifty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •