Search a number
-
+
1450531452111 = 3769072926291
BaseRepresentation
bin10101000110111010011…
…010010111010011001111
312010200002000211112100020
4111012322122113103033
5142231142022431421
63030210455033223
7206540343623610
oct25067232272317
95120060745306
101450531452111
1150a19220a165
121b515806b813
13a6a277c18b1
14502c575bc07
1527ae94d1dc6
hex151ba6974cf

1450531452111 has 8 divisors (see below), whose sum is σ = 2210333641344. Its totient is φ = 828875115480.

The previous prime is 1450531452101. The next prime is 1450531452127. The reversal of 1450531452111 is 1112541350541.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 1450531452111 - 26 = 1450531452047 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1450531452101) by changing a digit.

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, 34536463125 + ... + 34536463166.

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

Almost surely, 21450531452111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 69072926301.

The product of its (nonzero) digits is 12000, while the sum is 33.

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

Divisors: 1 3 7 21 69072926291 207218778873 483510484037 1450531452111