Base | Representation |
---|---|
bin | 11110001010010111001101… |
… | …011110101010100110000111 |
3 | 122101200112220100112221120111 |
4 | 132022113031132222212013 |
5 | 114341343343122230111 |
6 | 1150044103211413451 |
7 | 36640620461146624 |
oct | 3612271536524607 |
9 | 571615810487514 |
10 | 132653512305031 |
11 | 392a4047476393 |
12 | 12a65180a54287 |
13 | 59032320a0b73 |
14 | 24a866dca534b |
15 | 10509502c6a21 |
hex | 78a5cd7aa987 |
132653512305031 has 8 divisors (see below), whose sum is σ = 133983973547424. Its totient is φ = 131323385575200.
The previous prime is 132653512304987. The next prime is 132653512305071. The reversal of 132653512305031 is 130503215356231.
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 132653512305031 - 233 = 132644922370439 is a prime.
It is a super-3 number, since 3×1326535123050313 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132653512305071) 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, 82831011 + ... + 84417316.
It is an arithmetic number, because the mean of its divisors is an integer number (16747996693428).
Almost surely, 2132653512305031 is an apocalyptic number.
132653512305031 is a deficient number, since it is larger than the sum of its proper divisors (1330461242393).
132653512305031 is a wasteful number, since it uses less digits than its factorization.
132653512305031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167256281.
The product of its (nonzero) digits is 243000, while the sum is 40.
The spelling of 132653512305031 in words is "one hundred thirty-two trillion, six hundred fifty-three billion, five hundred twelve million, three hundred five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •