Search a number
-
+
1431035040523 = 11337386035889
BaseRepresentation
bin10100110100110000010…
…101011101001100001011
312001210202021220012112011
4110310300111131030023
5141421224432244043
63013224115200351
7205250245100524
oct24646025351413
95053667805464
101431035040523
11501997a78610
121b14168a60b7
13a4c3b55748a
144d3962c384b
1527357a8c59d
hex14d3055d30b

1431035040523 has 8 divisors (see below), whose sum is σ = 1565761569840. Its totient is φ = 1297080583680.

The previous prime is 1431035040439. The next prime is 1431035040559. The reversal of 1431035040523 is 3250405301341.

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 1431035040523 - 213 = 1431035032331 is a prime.

It is a super-2 number, since 2×14310350405232 (a number of 25 digits) contains 22 as substring.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 193014238 + ... + 193021651.

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

Almost surely, 21431035040523 is an apocalyptic number.

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

1431035040523 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 386036237.

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

The spelling of 1431035040523 in words is "one trillion, four hundred thirty-one billion, thirty-five million, forty thousand, five hundred twenty-three".

Divisors: 1 11 337 3707 386035889 4246394779 130094094593 1431035040523