Base | Representation |
---|---|
bin | 11110000001100111000000… |
… | …100100111001011100001011 |
3 | 122022120001021221210211201211 |
4 | 132001213000210321130023 |
5 | 114302014444101212301 |
6 | 1144503503532153551 |
7 | 36546304446345466 |
oct | 3601470044713413 |
9 | 568501257724654 |
10 | 132052000413451 |
11 | 39091a36710318 |
12 | 1298868b9088b7 |
13 | 588b5b1149871 |
14 | 24874cad042dd |
15 | 103ee97861051 |
hex | 7819c093970b |
132052000413451 has 8 divisors (see below), whose sum is σ = 144330080148864. Its totient is φ = 120275066789760.
The previous prime is 132052000413401. The next prime is 132052000413469. The reversal of 132052000413451 is 154314000250231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132052000413451 - 211 = 132052000411403 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132052000413401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 125286527380 + ... + 125286528433.
It is an arithmetic number, because the mean of its divisors is an integer number (18041260018608).
Almost surely, 2132052000413451 is an apocalyptic number.
132052000413451 is a deficient number, since it is larger than the sum of its proper divisors (12278079735413).
132052000413451 is a wasteful number, since it uses less digits than its factorization.
132052000413451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250573055861.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 132052000413451 its reverse (154314000250231), we get a palindrome (286366000663682).
The spelling of 132052000413451 in words is "one hundred thirty-two trillion, fifty-two billion, four hundred thirteen thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •