Base | Representation |
---|---|
bin | 111101101000101… |
… | …001100101011000 |
3 | 2200001210000020112 |
4 | 331220221211120 |
5 | 4104210110024 |
6 | 250335343452 |
7 | 34424263310 |
oct | 7550514530 |
9 | 2601700215 |
10 | 1034066264 |
11 | 490781320 |
12 | 24a381b88 |
13 | 136306c3a |
14 | 9b498440 |
15 | 60bb000e |
hex | 3da29958 |
1034066264 has 32 divisors (see below), whose sum is σ = 2417299200. Its totient is φ = 402882720.
The previous prime is 1034066263. The next prime is 1034066281. The reversal of 1034066264 is 4626604301.
1034066264 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 1034066264.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1034066263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 838724 + ... + 839955.
It is an arithmetic number, because the mean of its divisors is an integer number (75540600).
Almost surely, 21034066264 is an apocalyptic number.
1034066264 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1034066264 is an abundant number, since it is smaller than the sum of its proper divisors (1383232936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1034066264 is a wasteful number, since it uses less digits than its factorization.
1034066264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1678703 (or 1678699 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 32.
The square root of 1034066264 is about 32156.9007213071. The cubic root of 1034066264 is about 1011.2288620512.
The spelling of 1034066264 in words is "one billion, thirty-four million, sixty-six thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •