Base | Representation |
---|---|
bin | 11110000101111101011111… |
… | …000100111001000111111011 |
3 | 122100121122002121111202102202 |
4 | 132011331133010321013323 |
5 | 114321414333130004230 |
6 | 1145253114331420415 |
7 | 36610021316001122 |
oct | 3605753704710773 |
9 | 570548077452382 |
10 | 132351012344315 |
11 | 391978270a2656 |
12 | 12a1661a2b470b |
13 | 58b085435797b |
14 | 2497b74b22ab9 |
15 | 1047b483e8a45 |
hex | 785f5f1391fb |
132351012344315 has 32 divisors (see below), whose sum is σ = 162793865150784. Its totient is φ = 103263870758400.
The previous prime is 132351012344281. The next prime is 132351012344339. The reversal of 132351012344315 is 513443210153231.
It is a happy number.
It is not a de Polignac number, because 132351012344315 - 28 = 132351012344059 is a prime.
It is a super-2 number, since 2×1323510123443152 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1142110157 + ... + 1142226033.
It is an arithmetic number, because the mean of its divisors is an integer number (5087308285962).
Almost surely, 2132351012344315 is an apocalyptic number.
132351012344315 is a deficient number, since it is larger than the sum of its proper divisors (30442852806469).
132351012344315 is a wasteful number, since it uses less digits than its factorization.
132351012344315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149807.
The product of its (nonzero) digits is 129600, while the sum is 38.
Adding to 132351012344315 its reverse (513443210153231), we get a palindrome (645794222497546).
The spelling of 132351012344315 in words is "one hundred thirty-two trillion, three hundred fifty-one billion, twelve million, three hundred forty-four thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •