Search a number
-
+
13269041997 = 319922226201
BaseRepresentation
bin11000101101110010…
…11000001101001101
31021020202001011200220
430112321120031031
5204133333320442
610032401341553
7646550665431
oct142671301515
937222034626
1013269041997
11569a034712
1226a39378b9
131336050753
148dc3a09c1
15529d97eec
hex316e5834d

13269041997 has 8 divisors (see below), whose sum is σ = 17780961600. Its totient is φ = 8801575200.

The previous prime is 13269041917. The next prime is 13269042029. The reversal of 13269041997 is 79914096231.

13269041997 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is not a de Polignac number, because 13269041997 - 27 = 13269041869 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 213269041997 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 22226403.

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

The spelling of 13269041997 in words is "thirteen billion, two hundred sixty-nine million, forty-one thousand, nine hundred ninety-seven".

Divisors: 1 3 199 597 22226201 66678603 4423013999 13269041997