Search a number
-
+
106006510490 = 2547225545767
BaseRepresentation
bin110001010111001111…
…0101111101110011010
3101010121202221200122012
41202232132233232122
53214100131313430
6120410531225522
710441640320616
oct1425636575632
9333552850565
10106006510490
1140a58a03361
12186654482a2
139cc504796a
1451b8a86346
152b5670b695
hex18ae7afb9a

106006510490 has 16 divisors (see below), whose sum is σ = 194871543552. Its totient is φ = 41500420944.

The previous prime is 106006510439. The next prime is 106006510499. The reversal of 106006510490 is 94015600601.

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

It is a Curzon number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 112772414 + ... + 112773353.

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

Almost surely, 2106006510490 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 225545821.

The product of its (nonzero) digits is 6480, while the sum is 32.

The spelling of 106006510490 in words is "one hundred six billion, six million, five hundred ten thousand, four hundred ninety".

Divisors: 1 2 5 10 47 94 235 470 225545767 451091534 1127728835 2255457670 10600651049 21201302098 53003255245 106006510490