Search a number
-
+
38946259051 = 720172758429
BaseRepresentation
bin100100010001011000…
…001100000001101011
310201112020020221122221
4210101120030001223
51114230220242201
625520333254511
72546060511520
oct442130140153
9121466227587
1038946259051
1115576169957
12766b034437
13389897a2cb
141c56671147
15102e23c4a1
hex91160c06b

38946259051 has 8 divisors (see below), whose sum is σ = 44532093920. Its totient is φ = 33365945088.

The previous prime is 38946259019. The next prime is 38946259057. The reversal of 38946259051 is 15095264983.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 38946259051 - 25 = 38946259019 is a prime.

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

It is a Duffinian number.

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

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

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

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

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

Almost surely, 238946259051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2760453.

The product of its (nonzero) digits is 2332800, while the sum is 52.

The spelling of 38946259051 in words is "thirty-eight billion, nine hundred forty-six million, two hundred fifty-nine thousand, fifty-one".

Divisors: 1 7 2017 14119 2758429 19309003 5563751293 38946259051