Base | Representation |
---|---|
bin | 100010001110000… |
… | …0011000101101000 |
3 | 2222000112202220200 |
4 | 1010130003011220 |
5 | 4322420001433 |
6 | 305533552200 |
7 | 40311365454 |
oct | 10434030550 |
9 | 2860482820 |
10 | 1148203368 |
11 | 53a149204 |
12 | 280645660 |
13 | 153b5a3a0 |
14 | ac6c9664 |
15 | 6ac08613 |
hex | 44703168 |
1148203368 has 48 divisors (see below), whose sum is σ = 3348929220. Its totient is φ = 353293056.
The previous prime is 1148203361. The next prime is 1148203379. The reversal of 1148203368 is 8633028411.
It can be written as a sum of positive squares in 2 ways, for example, as 1147989924 + 213444 = 33882^2 + 462^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (1148203361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 612421 + ... + 614292.
Almost surely, 21148203368 is an apocalyptic number.
1148203368 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1148203368 is an abundant number, since it is smaller than the sum of its proper divisors (2200725852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1148203368 is a wasteful number, since it uses less digits than its factorization.
1148203368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1226738 (or 1226731 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The square root of 1148203368 is about 33885.1496676642. The cubic root of 1148203368 is about 1047.1436709492.
The spelling of 1148203368 in words is "one billion, one hundred forty-eight million, two hundred three thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •