Search a number
-
+
3249156691401 = 39531136466139
BaseRepresentation
bin101111010010000000110…
…101001001010111001001
3102111121122022112121122120
4233102000311021113021
5411213233103111101
610524350400041453
7453513063122145
oct57220065112711
912447568477576
103249156691401
111042a61279775
12445860003289
131a7517c8440a
14b338d708225
15597b84cdb36
hex2f480d495c9

3249156691401 has 8 divisors (see below), whose sum is σ = 4336754790240. Its totient is φ = 2163831526752.

The previous prime is 3249156691399. The next prime is 3249156691411. The reversal of 3249156691401 is 1041966519423.

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

It is not a de Polignac number, because 3249156691401 - 21 = 3249156691399 is a prime.

It is not an unprimeable number, because it can be changed into a prime (3249156691411) 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, 568230211 + ... + 568235928.

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

Almost surely, 23249156691401 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1136467095.

The product of its (nonzero) digits is 1399680, while the sum is 51.

The spelling of 3249156691401 in words is "three trillion, two hundred forty-nine billion, one hundred fifty-six million, six hundred ninety-one thousand, four hundred one".

Divisors: 1 3 953 2859 1136466139 3409398417 1083052230467 3249156691401