Base | Representation |
---|---|
bin | 11110000001010011111101… |
… | …101001100010100001100101 |
3 | 122022111002111202010120020011 |
4 | 132001103331221202201211 |
5 | 114301201103323012010 |
6 | 1144450242401210221 |
7 | 36544651616420554 |
oct | 3601237551424145 |
9 | 568432452116204 |
10 | 132031550204005 |
11 | 390842a2042281 |
12 | 12984723030971 |
13 | 58896a2400b0a |
14 | 248650ad07d9b |
15 | 103e69c314a8a |
hex | 7814fda62865 |
132031550204005 has 8 divisors (see below), whose sum is σ = 162122461646112. Its totient is φ = 103168839229008.
The previous prime is 132031550203841. The next prime is 132031550204051. The reversal of 132031550204005 is 500402055130231.
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 132031550204005 - 221 = 132031548106853 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 307050116539 + ... + 307050116968.
It is an arithmetic number, because the mean of its divisors is an integer number (20265307705764).
Almost surely, 2132031550204005 is an apocalyptic number.
It is an amenable number.
132031550204005 is a deficient number, since it is larger than the sum of its proper divisors (30090911442107).
132031550204005 is an equidigital number, since it uses as much as digits as its factorization.
132031550204005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614100233555.
The product of its (nonzero) digits is 18000, while the sum is 31.
It can be divided in two parts, 13203155020 and 4005, that added together give a square (13203159025 = 1149052).
The spelling of 132031550204005 in words is "one hundred thirty-two trillion, thirty-one billion, five hundred fifty million, two hundred four thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •