Base | Representation |
---|---|
bin | 11110000100100101011110… |
… | …101010100001001100001111 |
3 | 122100021121012000020201021012 |
4 | 132010211132222201030033 |
5 | 114313342321113300111 |
6 | 1145141445454155435 |
7 | 36600134522414330 |
oct | 3604453652411417 |
9 | 570247160221235 |
10 | 132256516150031 |
11 | 391607454a0219 |
12 | 12a002477b2b7b |
13 | 58a4974b92200 |
14 | 249336ca2a287 |
15 | 104546748148b |
hex | 78495eaa130f |
132256516150031 has 96 divisors (see below), whose sum is σ = 166802912087040. Its totient is φ = 102662951040000.
The previous prime is 132256516150013. The next prime is 132256516150039. The reversal of 132256516150031 is 130051615652231.
It is a de Polignac number, because none of the positive numbers 2k-132256516150031 is a prime.
It is a super-2 number, since 2×1322565161500312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132256516150039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 7379141636 + ... + 7379159558.
It is an arithmetic number, because the mean of its divisors is an integer number (1737530334240).
Almost surely, 2132256516150031 is an apocalyptic number.
132256516150031 is a deficient number, since it is larger than the sum of its proper divisors (34546395937009).
132256516150031 is a wasteful number, since it uses less digits than its factorization.
132256516150031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18617 (or 18604 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 132256516150031 in words is "one hundred thirty-two trillion, two hundred fifty-six billion, five hundred sixteen million, one hundred fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •