Base | Representation |
---|---|
bin | 101001010011000… |
… | …0011001010100110 |
3 | 10120120110011111000 |
4 | 1102212003022212 |
5 | 10314220044100 |
6 | 345300254130 |
7 | 46224210423 |
oct | 12246031246 |
9 | 3516404430 |
10 | 1385706150 |
11 | 6512165a4 |
12 | 3280a1346 |
13 | 19111568a |
14 | d2070d4a |
15 | 819be900 |
hex | 529832a6 |
1385706150 has 48 divisors (see below), whose sum is σ = 3818394000. Its totient is φ = 369521280.
The previous prime is 1385706143. The next prime is 1385706173. The reversal of 1385706150 is 516075831.
1385706150 is a `hidden beast` number, since 1 + 38 + 5 + 7 + 0 + 615 + 0 = 666.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 511875 + ... + 514574.
It is an arithmetic number, because the mean of its divisors is an integer number (79549875).
Almost surely, 21385706150 is an apocalyptic number.
1385706150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1385706150 is an abundant number, since it is smaller than the sum of its proper divisors (2432687850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1385706150 is a wasteful number, since it uses less digits than its factorization.
1385706150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1026470 (or 1026459 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 36.
The square root of 1385706150 is about 37225.0742108058. The cubic root of 1385706150 is about 1114.8686795277.
The spelling of 1385706150 in words is "one billion, three hundred eighty-five million, seven hundred six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •