Base | Representation |
---|---|
bin | 111101001000011… |
… | …100001100110000 |
3 | 2122110220001000211 |
4 | 331020130030300 |
5 | 4100024412312 |
6 | 245434353504 |
7 | 34262436013 |
oct | 7510341460 |
9 | 2573801024 |
10 | 1025622832 |
11 | 486a34683 |
12 | 24758b894 |
13 | 13463ba20 |
14 | 9a2db37a |
15 | 600933a7 |
hex | 3d21c330 |
1025622832 has 80 divisors (see below), whose sum is σ = 2229982272. Its totient is φ = 453841920.
The previous prime is 1025622757. The next prime is 1025622833. The reversal of 1025622832 is 2382265201.
It is a junction number, because it is equal to n+sod(n) for n = 1025622794 and 1025622803.
It is not an unprimeable number, because it can be changed into a prime (1025622833) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 545478 + ... + 547354.
Almost surely, 21025622832 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 1025622832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1114991136).
1025622832 is an abundant number, since it is smaller than the sum of its proper divisors (1204359440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1025622832 is a wasteful number, since it uses less digits than its factorization.
1025622832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2006 (or 2000 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 31.
The square root of 1025622832 is about 32025.3467116283. The cubic root of 1025622832 is about 1008.4690172685.
The spelling of 1025622832 in words is "one billion, twenty-five million, six hundred twenty-two thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •