Search a number
-
+
13926019630 = 254729629829
BaseRepresentation
bin11001111100000111…
…00011001000101110
31022221112021002120211
430332003203020232
5212010030112010
610221510533034
71002046133215
oct147603431056
938845232524
1013926019630
1159a6969736
12284796717a
13140c1a8703
1496173a07c
155678bd08a
hex33e0e322e

13926019630 has 16 divisors (see below), whose sum is σ = 25600173120. Its totient is φ = 5451888352.

The previous prime is 13926019577. The next prime is 13926019663. The reversal of 13926019630 is 3691062931.

13926019630 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 213926019630 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 29629883.

The product of its (nonzero) digits is 52488, while the sum is 40.

The spelling of 13926019630 in words is "thirteen billion, nine hundred twenty-six million, nineteen thousand, six hundred thirty".

Divisors: 1 2 5 10 47 94 235 470 29629829 59259658 148149145 296298290 1392601963 2785203926 6963009815 13926019630