Search a number
-
+
132150110154511 = 472972794048463
BaseRepresentation
bin11110000011000010011000…
…010111110110111100001111
3122022220102112101121002012011
4132003002120113312330033
5114310121411144421021
61145020531132322051
736556346631365131
oct3603023027667417
9568812471532164
10132150110154511
113911a602043949
12129a36b0613327
135897918156497
14248c156cb5051
1510427dab63de1
hex7830985f6f0f

132150110154511 has 4 divisors (see below), whose sum is σ = 132152904250272. Its totient is φ = 132147316058752.

The previous prime is 132150110154509. The next prime is 132150110154529. The reversal of 132150110154511 is 115451011051231.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 132150110154511 - 21 = 132150110154509 is a prime.

It is a super-2 number, since 2×1321501101545112 (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 (132150110154551) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1396976935 + ... + 1397071528.

It is an arithmetic number, because the mean of its divisors is an integer number (33038226062568).

Almost surely, 2132150110154511 is an apocalyptic number.

132150110154511 is a deficient number, since it is larger than the sum of its proper divisors (2794095761).

132150110154511 is an equidigital number, since it uses as much as digits as its factorization.

132150110154511 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 2794095760.

The product of its (nonzero) digits is 3000, while the sum is 31.

The spelling of 132150110154511 in words is "one hundred thirty-two trillion, one hundred fifty billion, one hundred ten million, one hundred fifty-four thousand, five hundred eleven".

Divisors: 1 47297 2794048463 132150110154511