Base | Representation |
---|---|
bin | 100011110100100111… |
… | …101011100100100000 |
3 | 10200021121101112102010 |
4 | 203310213223210200 |
5 | 1112233211444102 |
6 | 25400420152520 |
7 | 2531111513436 |
oct | 436447534440 |
9 | 120247345363 |
10 | 38463781152 |
11 | 15348890095 |
12 | 7555538740 |
13 | 381ca1b824 |
14 | 1c0c55ad56 |
15 | 1001bd5d6c |
hex | 8f49eb920 |
38463781152 has 24 divisors (see below), whose sum is σ = 100967425776. Its totient is φ = 12821260352.
The previous prime is 38463781151. The next prime is 38463781163. The reversal of 38463781152 is 25118736483.
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (38463781151) 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, 200332098 + ... + 200332289.
It is an arithmetic number, because the mean of its divisors is an integer number (4206976074).
Almost surely, 238463781152 is an apocalyptic number.
38463781152 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
38463781152 is an abundant number, since it is smaller than the sum of its proper divisors (62503644624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
38463781152 is a wasteful number, since it uses less digits than its factorization.
38463781152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400664400 (or 400664392 counting only the distinct ones).
The product of its digits is 967680, while the sum is 48.
The spelling of 38463781152 in words is "thirty-eight billion, four hundred sixty-three million, seven hundred eighty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •