Base | Representation |
---|---|
bin | 10111111100011101111110… |
… | …111101001101011001110001 |
3 | 111210212120122011002100122121 |
4 | 113330131332331031121301 |
5 | 102300401231333334041 |
6 | 1011550540050034241 |
7 | 31116266463565240 |
oct | 2774357675153161 |
9 | 453776564070577 |
10 | 105310433105521 |
11 | 306119a4061596 |
12 | b989a4ab78981 |
13 | 469b967689217 |
14 | 1c010a31a0957 |
15 | c295755b07d1 |
hex | 5fc77ef4d671 |
105310433105521 has 16 divisors (see below), whose sum is σ = 121137371150976. Its totient is φ = 89681020897536.
The previous prime is 105310433105513. The next prime is 105310433105593. The reversal of 105310433105521 is 125501334013501.
It is a cyclic number.
It is not a de Polignac number, because 105310433105521 - 23 = 105310433105513 is a prime.
It is a super-2 number, since 2×1053104331055212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105310433105621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 77586136 + ... + 78931801.
It is an arithmetic number, because the mean of its divisors is an integer number (7571085696936).
Almost surely, 2105310433105521 is an apocalyptic number.
It is an amenable number.
105310433105521 is a deficient number, since it is larger than the sum of its proper divisors (15826938045455).
105310433105521 is a wasteful number, since it uses less digits than its factorization.
105310433105521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156518568.
The product of its (nonzero) digits is 27000, while the sum is 34.
The spelling of 105310433105521 in words is "one hundred five trillion, three hundred ten billion, four hundred thirty-three million, one hundred five thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •