Base | Representation |
---|---|
bin | 11110001010010111001110… |
… | …001001110000010001000101 |
3 | 122101200112221010210210222110 |
4 | 132022113032021300101011 |
5 | 114341343404020203303 |
6 | 1150044104253451233 |
7 | 36640620656153112 |
oct | 3612271611602105 |
9 | 571615833723873 |
10 | 132653523600453 |
11 | 392a4052890849 |
12 | 12a651847a0b19 |
13 | 590323452724b |
14 | 24a86715a5909 |
15 | 10509512a8703 |
hex | 78a5ce270445 |
132653523600453 has 8 divisors (see below), whose sum is σ = 181185300527616. Its totient is φ = 86278714536800.
The previous prime is 132653523600439. The next prime is 132653523600463. The reversal of 132653523600453 is 354006325356231.
It is a happy number.
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 132653523600453 - 229 = 132652986729541 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132653523600463) 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, 539241965733 + ... + 539241965978.
It is an arithmetic number, because the mean of its divisors is an integer number (22648162565952).
Almost surely, 2132653523600453 is an apocalyptic number.
It is an amenable number.
132653523600453 is a deficient number, since it is larger than the sum of its proper divisors (48531776927163).
132653523600453 is a wasteful number, since it uses less digits than its factorization.
132653523600453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1078483931755.
The product of its (nonzero) digits is 5832000, while the sum is 48.
Adding to 132653523600453 its reverse (354006325356231), we get a palindrome (486659848956684).
The spelling of 132653523600453 in words is "one hundred thirty-two trillion, six hundred fifty-three billion, five hundred twenty-three million, six hundred thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •