Search a number
-
+
14310201031 = 72292044919
BaseRepresentation
bin11010101001111010…
…00101011011000111
31100221022011112101121
431110331011123013
5213301402413111
610323553134411
71014422462500
oct152475053307
940838145347
1014310201031
11608380a925
12293455a407
13147096bb99
1499a783ba7
1558b4a9871
hex354f456c7

14310201031 has 6 divisors (see below), whose sum is σ = 16646560440. Its totient is φ = 12265886556.

The previous prime is 14310201007. The next prime is 14310201041. The reversal of 14310201031 is 13010201341.

It is not a de Polignac number, because 14310201031 - 211 = 14310198983 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 14310200996 and 14310201014.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (14310201041) 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 5 ways as a sum of consecutive naturals, for example, 146022411 + ... + 146022508.

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

Almost surely, 214310201031 is an apocalyptic number.

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

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

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

The sum of its prime factors is 292044933 (or 292044926 counting only the distinct ones).

The product of its (nonzero) digits is 72, while the sum is 16.

Adding to 14310201031 its reverse (13010201341), we get a palindrome (27320402372).

The spelling of 14310201031 in words is "fourteen billion, three hundred ten million, two hundred one thousand, thirty-one".

Divisors: 1 7 49 292044919 2044314433 14310201031