Base | Representation |
---|---|
bin | 110001001100000100… |
… | …0100111111001110100 |
3 | 101002122122111220022122 |
4 | 1202120020213321310 |
5 | 3212313143100112 |
6 | 120305420015112 |
7 | 10426435614635 |
oct | 1423010477164 |
9 | 332578456278 |
10 | 105631612532 |
11 | 40886322a36 |
12 | 1857b991498 |
13 | 9c65484b54 |
14 | 5180d7788c |
15 | 2b33855872 |
hex | 1898227e74 |
105631612532 has 24 divisors (see below), whose sum is σ = 190841398272. Its totient is φ = 51105909600.
The previous prime is 105631612531. The next prime is 105631612549. The reversal of 105631612532 is 235216136501.
It is a super-2 number, since 2×1056316125322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105631612492 and 105631612501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105631612531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1081982 + ... + 1175562.
It is an arithmetic number, because the mean of its divisors is an integer number (7951724928).
Almost surely, 2105631612532 is an apocalyptic number.
It is an amenable number.
105631612532 is a deficient number, since it is larger than the sum of its proper divisors (85209785740).
105631612532 is a wasteful number, since it uses less digits than its factorization.
105631612532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102719 (or 102717 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 105631612532 in words is "one hundred five billion, six hundred thirty-one million, six hundred twelve thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •