Base | Representation |
---|---|
bin | 100000000011001… |
… | …1010111100001000 |
3 | 2202221121020210202 |
4 | 1000012122330020 |
5 | 4200302100112 |
6 | 254414031332 |
7 | 35435650643 |
oct | 10006327410 |
9 | 2687536722 |
10 | 1075425032 |
11 | 50205a820 |
12 | 2601a8548 |
13 | 141a58096 |
14 | a2b82a5a |
15 | 6462e6c2 |
hex | 4019af08 |
1075425032 has 64 divisors (see below), whose sum is σ = 2353458240. Its totient is φ = 455270400.
The previous prime is 1075424993. The next prime is 1075425041. The reversal of 1075425032 is 2305245701.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1075424986 and 1075425004.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 141407 + ... + 148817.
It is an arithmetic number, because the mean of its divisors is an integer number (36772785).
Almost surely, 21075425032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1075425032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1176729120).
1075425032 is an abundant number, since it is smaller than the sum of its proper divisors (1278033208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1075425032 is a wasteful number, since it uses less digits than its factorization.
1075425032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7542 (or 7538 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 29.
The square root of 1075425032 is about 32793.6736581921. The cubic root of 1075425032 is about 1024.5347980587.
The spelling of 1075425032 in words is "one billion, seventy-five million, four hundred twenty-five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •