Base | Representation |
---|---|
bin | 100000000010101… |
… | …0101101110100000 |
3 | 2202221001211220220 |
4 | 1000011111232200 |
5 | 4200214012121 |
6 | 254404003040 |
7 | 35433360300 |
oct | 10005255640 |
9 | 2687054826 |
10 | 1075141536 |
11 | 501986827 |
12 | 260090480 |
13 | 141989031 |
14 | a2b0b600 |
15 | 645c56c6 |
hex | 40155ba0 |
1075141536 has 72 divisors (see below), whose sum is σ = 3283035840. Its totient is φ = 307181952.
The previous prime is 1075141519. The next prime is 1075141537. The reversal of 1075141536 is 6351415701.
It is a junction number, because it is equal to n+sod(n) for n = 1075141497 and 1075141506.
It is not an unprimeable number, because it can be changed into a prime (1075141537) 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, 109576 + ... + 118983.
It is an arithmetic number, because the mean of its divisors is an integer number (45597720).
Almost surely, 21075141536 is an apocalyptic number.
1075141536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1075141536 is an abundant number, since it is smaller than the sum of its proper divisors (2207894304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1075141536 is a wasteful number, since it uses less digits than its factorization.
1075141536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228586 (or 228571 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 33.
The square root of 1075141536 is about 32789.3509542351. The cubic root of 1075141536 is about 1024.4447632555. Note that the first 3 decimals are identical.
The spelling of 1075141536 in words is "one billion, seventy-five million, one hundred forty-one thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •