Base | Representation |
---|---|
bin | 111101101000111… |
… | …000010011101000 |
3 | 2200001220001222000 |
4 | 331220320103220 |
5 | 4104214022233 |
6 | 250340531000 |
7 | 34424634156 |
oct | 7550702350 |
9 | 2601801860 |
10 | 1034126568 |
11 | 490812662 |
12 | 24a3b0a60 |
13 | 136328517 |
14 | 9b4b23d6 |
15 | 60bc2d13 |
hex | 3da384e8 |
1034126568 has 64 divisors (see below), whose sum is σ = 2877316800. Its totient is φ = 344139840.
The previous prime is 1034126567. The next prime is 1034126581. The reversal of 1034126568 is 8656214301.
It is a happy number.
1034126568 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 (1034126567) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 139155 + ... + 146397.
It is an arithmetic number, because the mean of its divisors is an integer number (44958075).
Almost surely, 21034126568 is an apocalyptic number.
1034126568 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1034126568 is an abundant number, since it is smaller than the sum of its proper divisors (1843190232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1034126568 is a wasteful number, since it uses less digits than its factorization.
1034126568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7919 (or 7909 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 1034126568 is about 32157.8383601883. The cubic root of 1034126568 is about 1011.2485190636.
The spelling of 1034126568 in words is "one billion, thirty-four million, one hundred twenty-six thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •