Base | Representation |
---|---|
bin | 11110000010101001011010… |
… | …011111010111011000001101 |
3 | 122022210212100002120101200101 |
4 | 132002221122133113120031 |
5 | 114304202010321144323 |
6 | 1145000335043331101 |
7 | 36554410411061611 |
oct | 3602513237273015 |
9 | 568725302511611 |
10 | 132123302131213 |
11 | 3910a1a5673198 |
12 | 1299a46a680a91 |
13 | 5895235180cc3 |
14 | 248ab32767341 |
15 | 1041c6c3a0dad |
hex | 782a5a7d760d |
132123302131213 has 8 divisors (see below), whose sum is σ = 132540843723840. Its totient is φ = 131706321375840.
The previous prime is 132123302131133. The next prime is 132123302131243. The reversal of 132123302131213 is 312131203321231.
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 132123302131213 - 225 = 132123268576781 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132123302131243) 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, 139737403 + ... + 140679736.
It is an arithmetic number, because the mean of its divisors is an integer number (16567605465480).
Almost surely, 2132123302131213 is an apocalyptic number.
It is an amenable number.
132123302131213 is a deficient number, since it is larger than the sum of its proper divisors (417541592627).
132123302131213 is a wasteful number, since it uses less digits than its factorization.
132123302131213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280418627.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 132123302131213 its reverse (312131203321231), we get a palindrome (444254505452444).
The spelling of 132123302131213 in words is "one hundred thirty-two trillion, one hundred twenty-three billion, three hundred two million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •