Base | Representation |
---|---|
bin | 111111001001010… |
… | …110000001011100 |
3 | 2201211110210221120 |
4 | 333021112001130 |
5 | 4132202222413 |
6 | 253042530540 |
7 | 35152604604 |
oct | 7711260134 |
9 | 2654423846 |
10 | 1059414108 |
11 | 4a4014555 |
12 | 256966a50 |
13 | 13b64056c |
14 | a09b5c04 |
15 | 6301a723 |
hex | 3f25605c |
1059414108 has 12 divisors (see below), whose sum is σ = 2471966280. Its totient is φ = 353138032.
The previous prime is 1059414107. The next prime is 1059414133. The reversal of 1059414108 is 8014149501.
1059414108 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×10594141082 = 2244716504458871328, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1059414101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44142243 + ... + 44142266.
It is an arithmetic number, because the mean of its divisors is an integer number (205997190).
Almost surely, 21059414108 is an apocalyptic number.
It is an amenable number.
1059414108 is an abundant number, since it is smaller than the sum of its proper divisors (1412552172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1059414108 is a wasteful number, since it uses less digits than its factorization.
1059414108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88284516 (or 88284514 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 33.
The square root of 1059414108 is about 32548.6421836611. The cubic root of 1059414108 is about 1019.4249315124.
The spelling of 1059414108 in words is "one billion, fifty-nine million, four hundred fourteen thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •