Base | Representation |
---|---|
bin | 110001001011001010… |
… | …0001110110011111011 |
3 | 101002120112002202102210 |
4 | 1202112110032303323 |
5 | 3212232340213201 |
6 | 120302410030203 |
7 | 10425615356115 |
oct | 1422624166373 |
9 | 332515082383 |
10 | 105601101051 |
11 | 40870083236 |
12 | 18571718363 |
13 | 9c5c061114 |
14 | 517acb43b5 |
15 | 2b30d2a1d6 |
hex | 189650ecfb |
105601101051 has 32 divisors (see below), whose sum is σ = 146678736960. Its totient is φ = 67521484800.
The previous prime is 105601101019. The next prime is 105601101101. The reversal of 105601101051 is 150101106501.
It is a happy number.
It is not a de Polignac number, because 105601101051 - 25 = 105601101019 is a prime.
It is a super-2 number, since 2×1056011010512 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105601101251) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25425591 + ... + 25429743.
It is an arithmetic number, because the mean of its divisors is an integer number (4583710530).
Almost surely, 2105601101051 is an apocalyptic number.
105601101051 is a deficient number, since it is larger than the sum of its proper divisors (41077635909).
105601101051 is a wasteful number, since it uses less digits than its factorization.
105601101051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7647.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 105601101051 its reverse (150101106501), we get a palindrome (255702207552).
The spelling of 105601101051 in words is "one hundred five billion, six hundred one million, one hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •