Search a number
-
+
10605215701 = 74314273507
BaseRepresentation
bin10011110000001111…
…01011111111010101
31000101002120202222201
421320013223333111
5133204413400301
64512202324501
7523543563133
oct117007537725
930332522881
1010605215701
114552405583
12207b7b9731
1310001c1082
147286a6753
154210ab201
hex2781ebfd5

10605215701 has 4 divisors (see below), whose sum is σ = 10619489952. Its totient is φ = 10590941452.

The previous prime is 10605215681. The next prime is 10605215707. The reversal of 10605215701 is 10751250601.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 10605215701 - 29 = 10605215189 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7136011 + ... + 7137496.

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

Almost surely, 210605215701 is an apocalyptic number.

It is an amenable number.

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

10605215701 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 14274250.

The product of its (nonzero) digits is 2100, while the sum is 28.

The spelling of 10605215701 in words is "ten billion, six hundred five million, two hundred fifteen thousand, seven hundred one".

Divisors: 1 743 14273507 10605215701