Search a number
-
+
106470296299 = 253674197197
BaseRepresentation
bin110001100101000011…
…1111100101011101011
3101011211002122110011101
41203022013330223223
53221022343440144
6120524535542231
710456301405053
oct1431207745353
9334732573141
10106470296299
1141176785514
121877482a977
13a06a160433
1452204d2563
152b822be6d4
hex18ca1fcaeb

106470296299 has 4 divisors (see below), whose sum is σ = 106474518864. Its totient is φ = 106466073736.

The previous prime is 106470296279. The next prime is 106470296311. The reversal of 106470296299 is 992692074601.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 106470296299 - 27 = 106470296171 is a prime.

It is a super-2 number, since 2×1064702962992 (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 (106470296209) 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, 2073232 + ... + 2123965.

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

Almost surely, 2106470296299 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4222564.

The product of its (nonzero) digits is 2939328, while the sum is 55.

The spelling of 106470296299 in words is "one hundred six billion, four hundred seventy million, two hundred ninety-six thousand, two hundred ninety-nine".

Divisors: 1 25367 4197197 106470296299