Search a number
-
+
106801455297 = 335600485099
BaseRepresentation
bin110001101110111011…
…1001110000011000001
3101012200011210001220110
41203131313032003001
53222212133032142
6121021445501533
710500432251145
oct1433567160301
9335604701813
10106801455297
1141326701139
12188477118a9
13a0c094a8c4
145252497225
152ba13d599c
hex18dddce0c1

106801455297 has 4 divisors (see below), whose sum is σ = 142401940400. Its totient is φ = 71200970196.

The previous prime is 106801455289. The next prime is 106801455301. The reversal of 106801455297 is 792554108601.

It is a happy number.

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 not a de Polignac number, because 106801455297 - 23 = 106801455289 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (106801455217) 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 3 ways as a sum of consecutive naturals, for example, 17800242547 + ... + 17800242552.

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

Almost surely, 2106801455297 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 35600485102.

The product of its (nonzero) digits is 604800, while the sum is 48.

The spelling of 106801455297 in words is "one hundred six billion, eight hundred one million, four hundred fifty-five thousand, two hundred ninety-seven".

Divisors: 1 3 35600485099 106801455297