Base | Representation |
---|---|
bin | 10111111001101100111100… |
… | …110001001101011001100101 |
3 | 111210012101222112002111002102 |
4 | 113321230330301031121211 |
5 | 102234242431042240001 |
6 | 1011323341443021445 |
7 | 31066460056662200 |
oct | 2771547461153145 |
9 | 453171875074072 |
10 | 105120344102501 |
11 | 30549318845092 |
12 | b95903a66a885 |
13 | 4686a62794300 |
14 | 1bd5bcd4b4937 |
15 | c2464c2b7e6b |
hex | 5f9b3cc4d665 |
105120344102501 has 36 divisors (see below), whose sum is σ = 138169867489632. Its totient is φ = 79555960227744.
The previous prime is 105120344102483. The next prime is 105120344102567. The reversal of 105120344102501 is 105201443021501.
It is a happy number.
It is not a de Polignac number, because 105120344102501 - 26 = 105120344102437 is a prime.
It is a super-2 number, since 2×1051203441025012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105120344102591) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 275769551 + ... + 276150476.
It is an arithmetic number, because the mean of its divisors is an integer number (3838051874712).
Almost surely, 2105120344102501 is an apocalyptic number.
It is an amenable number.
105120344102501 is a deficient number, since it is larger than the sum of its proper divisors (33049523387131).
105120344102501 is a wasteful number, since it uses less digits than its factorization.
105120344102501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 551920090 (or 551920070 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 29.
The spelling of 105120344102501 in words is "one hundred five trillion, one hundred twenty billion, three hundred forty-four million, one hundred two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •