Base | Representation |
---|---|
bin | 10111111100111111001000… |
… | …001000011100101000110001 |
3 | 111210222222111022002122212200 |
4 | 113330333020020130220301 |
5 | 102301442122223323031 |
6 | 1012015143240013413 |
7 | 31121666410640466 |
oct | 2774771010345061 |
9 | 453888438078780 |
10 | 105346020526641 |
11 | 30625aa6249824 |
12 | b994921161269 |
13 | 46a21194c315b |
14 | 1c02abb6db66d |
15 | c2a4599c68e6 |
hex | 5fcfc821ca31 |
105346020526641 has 24 divisors (see below), whose sum is σ = 160175970227520. Its totient is φ = 66534023720736.
The previous prime is 105346020526559. The next prime is 105346020526673. The reversal of 105346020526641 is 146625020643501.
105346020526641 is a `hidden beast` number, since 1 + 0 + 5 + 3 + 4 + 60 + 2 + 0 + 526 + 64 + 1 = 666.
It is a de Polignac number, because none of the positive numbers 2k-105346020526641 is a prime.
It is a super-2 number, since 2×1053460205266412 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105346020526741) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 39441340 + ... + 42027506.
It is an arithmetic number, because the mean of its divisors is an integer number (6673998759480).
Almost surely, 2105346020526641 is an apocalyptic number.
It is an amenable number.
105346020526641 is a deficient number, since it is larger than the sum of its proper divisors (54829949700879).
105346020526641 is a wasteful number, since it uses less digits than its factorization.
105346020526641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2824405 (or 2824402 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 45.
The spelling of 105346020526641 in words is "one hundred five trillion, three hundred forty-six billion, twenty million, five hundred twenty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •