Base | Representation |
---|---|
bin | 1110111101010001… |
… | …00101110111110000 |
3 | 202201122010220002201 |
4 | 13132220211313300 |
5 | 112421204301003 |
6 | 3404453552544 |
7 | 402665102260 |
oct | 73650456760 |
9 | 22648126081 |
10 | 8030150128 |
11 | 34508a0710 |
12 | 1681345754 |
13 | 9ac86b530 |
14 | 5626b57a0 |
15 | 31eea3b1d |
hex | 1dea25df0 |
8030150128 has 80 divisors (see below), whose sum is σ = 20889662976. Its totient is φ = 2887960320.
The previous prime is 8030150119. The next prime is 8030150143. The reversal of 8030150128 is 8210510308.
It is a super-2 number, since 2×80301501282 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 8030150096 and 8030150105.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 234676 + ... + 266707.
Almost surely, 28030150128 is an apocalyptic number.
8030150128 is a gapful number since it is divisible by the number (88) formed by its first and last digit.
It is an amenable number.
8030150128 is an abundant number, since it is smaller than the sum of its proper divisors (12859512848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8030150128 is a wasteful number, since it uses less digits than its factorization.
8030150128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 501422 (or 501416 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 28.
The square root of 8030150128 is about 89611.1049368325. The cubic root of 8030150128 is about 2002.5093609038.
The spelling of 8030150128 in words is "eight billion, thirty million, one hundred fifty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •