Base | Representation |
---|---|
bin | 11110110100010010000… |
… | …11100000010011100100 |
3 | 10202020002212102221001012 |
4 | 33122021003200103210 |
5 | 114322022001232124 |
6 | 2130233441321352 |
7 | 136333366663520 |
oct | 17321103402344 |
9 | 3666085387035 |
10 | 1058861352164 |
11 | 3790736a0a90 |
12 | 15126a636258 |
13 | 78b08b62ac5 |
14 | 3936b9bad80 |
15 | 1c82404be0e |
hex | f6890e04e4 |
1058861352164 has 96 divisors (see below), whose sum is σ = 2470360032000. Its totient is φ = 384431616000.
The previous prime is 1058861352163. The next prime is 1058861352167. The reversal of 1058861352164 is 4612531688501.
It is a super-2 number, since 2×10588613521642 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1058861352163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 472289 + ... + 1529960.
It is an arithmetic number, because the mean of its divisors is an integer number (25732917000).
Almost surely, 21058861352164 is an apocalyptic number.
1058861352164 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1058861352164 is an abundant number, since it is smaller than the sum of its proper divisors (1411498679836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1058861352164 is a wasteful number, since it uses less digits than its factorization.
1058861352164 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2002389 (or 2002387 counting only the distinct ones).
The product of its (nonzero) digits is 1382400, while the sum is 50.
The spelling of 1058861352164 in words is "one trillion, fifty-eight billion, eight hundred sixty-one million, three hundred fifty-two thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •