Search a number
-
+
142703901150969 = 3342591388480897
BaseRepresentation
bin100000011100100111010111…
…010101100000111011111001
3200201021100201020021210101010
4200130213113111200323321
5122201030042143312334
61223301133412344133
742026005462614504
oct4034472725407371
9621240636253333
10142703901150969
1141519425a0a134
1214008b7b915049
136181bc6703752
142734c9722413b
1511770c8cbd0e9
hex81c9d7560ef9

142703901150969 has 8 divisors (see below), whose sum is σ = 190277422261920. Its totient is φ = 95133157070336.

The previous prime is 142703901150931. The next prime is 142703901150973. The reversal of 142703901150969 is 969051109307241.

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 142703901150969 - 29 = 142703901150457 is a prime.

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

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

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

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

Almost surely, 2142703901150969 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1388515159.

The product of its (nonzero) digits is 3674160, while the sum is 57.

The spelling of 142703901150969 in words is "one hundred forty-two trillion, seven hundred three billion, nine hundred one million, one hundred fifty thousand, nine hundred sixty-nine".

Divisors: 1 3 34259 102777 1388480897 4165442691 47567967050323 142703901150969