Base | Representation |
---|---|
bin | 11110110100001110001… |
… | …00011001100100001111 |
3 | 10202020000112202002202002 |
4 | 33122013010121210033 |
5 | 114321434434013041 |
6 | 2130230251222515 |
7 | 136332513530132 |
oct | 17320704314417 |
9 | 3666015662662 |
10 | 1058828032271 |
11 | 379056903289 |
12 | 15125b447a3b |
13 | 78b01c979a9 |
14 | 393673c6219 |
15 | 1c82116959b |
hex | f68711990f |
1058828032271 has 8 divisors (see below), whose sum is σ = 1059253905120. Its totient is φ = 1058402243808.
The previous prime is 1058828032247. The next prime is 1058828032277. The reversal of 1058828032271 is 1722308288501.
1058828032271 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1058828032271 is a prime.
It is a super-2 number, since 2×10588280322712 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1058828032277) 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, 37011545 + ... + 37040141.
It is an arithmetic number, because the mean of its divisors is an integer number (132406738140).
Almost surely, 21058828032271 is an apocalyptic number.
1058828032271 is a deficient number, since it is larger than the sum of its proper divisors (425872849).
1058828032271 is an equidigital number, since it uses as much as digits as its factorization.
1058828032271 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42193.
The product of its (nonzero) digits is 430080, while the sum is 47.
The spelling of 1058828032271 in words is "one trillion, fifty-eight billion, eight hundred twenty-eight million, thirty-two thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •