Base | Representation |
---|---|
bin | 110000111010010011… |
… | …1110110010110111111 |
3 | 101001010010102102110110 |
4 | 1201310213312112333 |
5 | 3210103132142211 |
6 | 120130334041103 |
7 | 10405612503615 |
oct | 1416447662677 |
9 | 331103372413 |
10 | 105035818431 |
11 | 405aaa88015 |
12 | 18434349193 |
13 | 9b9bbcc76b |
14 | 5125ba76b5 |
15 | 2aeb3b8ea6 |
hex | 18749f65bf |
105035818431 has 8 divisors (see below), whose sum is σ = 142421448960. Its totient is φ = 68837033432.
The previous prime is 105035818429. The next prime is 105035818463. The reversal of 105035818431 is 134818530501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105035818431 - 21 = 105035818429 is a prime.
It is a super-2 number, since 2×1050358184312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105035818431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105035819431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 296711175 + ... + 296711528.
It is an arithmetic number, because the mean of its divisors is an integer number (17802681120).
Almost surely, 2105035818431 is an apocalyptic number.
105035818431 is a deficient number, since it is larger than the sum of its proper divisors (37385630529).
105035818431 is an equidigital number, since it uses as much as digits as its factorization.
105035818431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 593422765.
The product of its (nonzero) digits is 57600, while the sum is 39.
The spelling of 105035818431 in words is "one hundred five billion, thirty-five million, eight hundred eighteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •