Base | Representation |
---|---|
bin | 110001011110001101… |
… | …0100101100101110111 |
3 | 101011020001212111111221 |
4 | 1202330122211211313 |
5 | 3220040004121211 |
6 | 120450042211211 |
7 | 10450506443065 |
oct | 1427432454567 |
9 | 334201774457 |
10 | 106240301431 |
11 | 41068975a10 |
12 | 1870b7b3b07 |
13 | a0316035b4 |
14 | 51dbb43035 |
15 | 2b6bedcc71 |
hex | 18bc6a5977 |
106240301431 has 8 divisors (see below), whose sum is σ = 115908710400. Its totient is φ = 96573592440.
The previous prime is 106240301429. The next prime is 106240301441. The reversal of 106240301431 is 134103042601.
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 106240301431 - 21 = 106240301429 is a prime.
It is a super-2 number, since 2×1062403014312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106240301396 and 106240301405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106240301441) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 292521 + ... + 545938.
It is an arithmetic number, because the mean of its divisors is an integer number (14488588800).
Almost surely, 2106240301431 is an apocalyptic number.
106240301431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
106240301431 is a deficient number, since it is larger than the sum of its proper divisors (9668408969).
106240301431 is a wasteful number, since it uses less digits than its factorization.
106240301431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 849989.
The product of its (nonzero) digits is 1728, while the sum is 25.
The spelling of 106240301431 in words is "one hundred six billion, two hundred forty million, three hundred one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •