Search a number
-
+
106255714510 = 2511965961041
BaseRepresentation
bin110001011110101010…
…1011000100011001110
3101011021010212120021201
41202331111120203032
53220102430331020
6120451352420114
710451054446141
oct1427525304316
9334233776251
10106255714510
1141076642aa0
12187149a763a
13a03486bc6a
1451ddbd6058
152b6d534a0a
hex18bd5588ce

106255714510 has 16 divisors (see below), whose sum is σ = 208647585072. Its totient is φ = 38638441600.

The previous prime is 106255714471. The next prime is 106255714541. The reversal of 106255714510 is 15417552601.

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

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

It is a congruent number.

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 482980411 + ... + 482980630.

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

Almost surely, 2106255714510 is an apocalyptic number.

106255714510 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 965961059.

The product of its (nonzero) digits is 42000, while the sum is 37.

The spelling of 106255714510 in words is "one hundred six billion, two hundred fifty-five million, seven hundred fourteen thousand, five hundred ten".

Divisors: 1 2 5 10 11 22 55 110 965961041 1931922082 4829805205 9659610410 10625571451 21251142902 53127857255 106255714510