Search a number
-
+
13905701 = 193123609
BaseRepresentation
bin110101000010…
…111100100101
3222011111000222
4311002330211
512024440301
61214014125
7226124255
oct65027445
928144028
1013905701
117938617
1247a7345
132b5b534
141bbd965
15134a31b
hexd42f25

13905701 has 8 divisors (see below), whose sum is σ = 15110400. Its totient is φ = 12748320.

The previous prime is 13905607. The next prime is 13905707. The reversal of 13905701 is 10750931.

13905701 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 a cyclic number.

It is not a de Polignac number, because 13905701 - 222 = 9711397 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 213905701 is an apocalyptic number.

It is an amenable number.

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

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

13905701 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 23659.

The product of its (nonzero) digits is 945, while the sum is 26.

The square root of 13905701 is about 3729.0348617303. The cubic root of 13905701 is about 240.4718783168.

The spelling of 13905701 in words is "thirteen million, nine hundred five thousand, seven hundred one".

Divisors: 1 19 31 589 23609 448571 731879 13905701