Base | Representation |
---|---|
bin | 111110000000011… |
… | …011110100000000 |
3 | 2200111111210010020 |
4 | 332000123310000 |
5 | 4112304120222 |
6 | 251121133440 |
7 | 34531262301 |
oct | 7600336400 |
9 | 2614453106 |
10 | 1040301312 |
11 | 49424a856 |
12 | 25048a280 |
13 | 1376aac0b |
14 | 9c23c7a8 |
15 | 614e265c |
hex | 3e01bd00 |
1040301312 has 72 divisors (see below), whose sum is σ = 2787607200. Its totient is φ = 344401920.
The previous prime is 1040301307. The next prime is 1040301389. The reversal of 1040301312 is 2131030401.
It is a junction number, because it is equal to n+sod(n) for n = 1040301291 and 1040301300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 109887 + ... + 118977.
Almost surely, 21040301312 is an apocalyptic number.
1040301312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1040301312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1393803600).
1040301312 is an abundant number, since it is smaller than the sum of its proper divisors (1747305888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040301312 is an equidigital number, since it uses as much as digits as its factorization.
1040301312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9259 (or 9245 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1040301312 is about 32253.7022991160. The cubic root of 1040301312 is about 1013.2572395923.
Adding to 1040301312 its reverse (2131030401), we get a palindrome (3171331713).
The spelling of 1040301312 in words is "one billion, forty million, three hundred one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •