Base | Representation |
---|---|
bin | 101001100101110… |
… | …1000001001001010 |
3 | 10121020222122020000 |
4 | 1103023220021022 |
5 | 10324230310223 |
6 | 350251343430 |
7 | 46404016056 |
oct | 12313501112 |
9 | 3536878200 |
10 | 1395556938 |
11 | 656834646 |
12 | 32b451b76 |
13 | 193184349 |
14 | d34b6c66 |
15 | 827b8543 |
hex | 532e824a |
1395556938 has 20 divisors (see below), whose sum is σ = 3127081650. Its totient is φ = 465185592.
The previous prime is 1395556933. The next prime is 1395556957. The reversal of 1395556938 is 8396555931.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 706336929 + 689220009 = 26577^2 + 26253^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (1395556933) 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 9 ways as a sum of consecutive naturals, for example, 4307113 + ... + 4307436.
Almost surely, 21395556938 is an apocalyptic number.
1395556938 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
1395556938 is an abundant number, since it is smaller than the sum of its proper divisors (1731524712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1395556938 is an equidigital number, since it uses as much as digits as its factorization.
1395556938 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8614563 (or 8614554 counting only the distinct ones).
The product of its digits is 4374000, while the sum is 54.
The square root of 1395556938 is about 37357.1537727381. The cubic root of 1395556938 is about 1117.5042583505.
The spelling of 1395556938 in words is "one billion, three hundred ninety-five million, five hundred fifty-six thousand, nine hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •