Search a number
-
+
14603140083 = 37299672
BaseRepresentation
bin11011001100110101…
…00011101111110011
31101200201101101020010
431212122203233303
5214401400440313
610413015550003
71024610433300
oct154632435763
941621341203
1014603140083
116214101314
1229b668b303
1314b9566abc
149c763a0a7
155a70714c3
hex3666a3bf3

14603140083 has 18 divisors (see below), whose sum is σ = 22652040996. Its totient is φ = 8343814248.

The previous prime is 14603140081. The next prime is 14603140103. The reversal of 14603140083 is 38004130641.

It is not a de Polignac number, because 14603140083 - 21 = 14603140081 is a prime.

It is a super-3 number, since 3×146031400833 (a number of 31 digits) contains 333 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 14603140083.

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

It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 1460166 + ... + 1470132.

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

Almost surely, 214603140083 is an apocalyptic number.

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

14603140083 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 6912, while the sum is 30.

Multiplying 14603140083 by its product of nonzero digits (6912), we get a square (100936904253696 = 100467362).

The spelling of 14603140083 in words is "fourteen billion, six hundred three million, one hundred forty thousand, eighty-three".

Divisors: 1 3 7 21 49 147 9967 29901 69769 209307 488383 1465149 99341089 298023267 695387623 2086162869 4867713361 14603140083