Base | Representation |
---|---|
bin | 110000111010001011… |
… | …0000001010010111011 |
3 | 101001002210121222012220 |
4 | 1201310112001102323 |
5 | 3210100433112020 |
6 | 120130045535123 |
7 | 10405524666444 |
oct | 1416426012273 |
9 | 331083558186 |
10 | 105031144635 |
11 | 405a838557a |
12 | 184328744a3 |
13 | 9b9ac542c1 |
14 | 512530c2cb |
15 | 2aeac94240 |
hex | 18745814bb |
105031144635 has 64 divisors (see below), whose sum is σ = 176308199424. Its totient is φ = 53336448000.
The previous prime is 105031144633. The next prime is 105031144657. The reversal of 105031144635 is 536441130501.
It is a happy number.
It is not a de Polignac number, because 105031144635 - 21 = 105031144633 is a prime.
It is a super-2 number, since 2×1050311446352 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105031144596 and 105031144605.
It is not an unprimeable number, because it can be changed into a prime (105031144633) 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 63 ways as a sum of consecutive naturals, for example, 10603185 + ... + 10613085.
It is an arithmetic number, because the mean of its divisors is an integer number (2754815616).
Almost surely, 2105031144635 is an apocalyptic number.
105031144635 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
105031144635 is a deficient number, since it is larger than the sum of its proper divisors (71277054789).
105031144635 is a wasteful number, since it uses less digits than its factorization.
105031144635 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10364.
The product of its (nonzero) digits is 21600, while the sum is 33.
The spelling of 105031144635 in words is "one hundred five billion, thirty-one million, one hundred forty-four thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •