Search a number
-
+
38921196748 = 2271390042741
BaseRepresentation
bin100100001111111000…
…100101010011001100
310201110111002122122111
4210033320211103030
51114202311243443
625514040153404
72545334466550
oct441770452314
9121414078574
1038921196748
1115563001205
127662768864
133893713945
141c531c9860
15102be3b69d
hex90fe254cc

38921196748 has 12 divisors (see below), whose sum is σ = 77842393552. Its totient is φ = 16680512880.

The previous prime is 38921196679. The next prime is 38921196749. The reversal of 38921196748 is 84769112983.

38921196748 is an admirable number.

It is a super-3 number, since 3×389211967483 (a number of 33 digits) contains 333 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 38921196692 and 38921196701.

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

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

Almost surely, 238921196748 is an apocalyptic number.

It is an amenable number.

38921196748 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 1390042752 (or 1390042750 counting only the distinct ones).

The product of its digits is 5225472, while the sum is 58.

The spelling of 38921196748 in words is "thirty-eight billion, nine hundred twenty-one million, one hundred ninety-six thousand, seven hundred forty-eight".

Divisors: 1 2 4 7 14 28 1390042741 2780085482 5560170964 9730299187 19460598374 38921196748