Base | Representation |
---|---|
bin | 100101100010010010… |
… | …010011111100001101 |
3 | 10212000211110201200101 |
4 | 211202102103330031 |
5 | 1130020220014401 |
6 | 30303143331101 |
7 | 2624522366056 |
oct | 454222237415 |
9 | 125024421611 |
10 | 40303673101 |
11 | 1610241114a |
12 | 7989750a91 |
13 | 3a53c681a3 |
14 | 1d44a5972d |
15 | 10ad4be101 |
hex | 962493f0d |
40303673101 has 4 divisors (see below), whose sum is σ = 40313745472. Its totient is φ = 40293600732.
The previous prime is 40303673093. The next prime is 40303673119. The reversal of 40303673101 is 10137630304.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 40303673101 - 23 = 40303673093 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 40303673101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40303673171) 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 3 ways as a sum of consecutive naturals, for example, 5030181 + ... + 5038186.
It is an arithmetic number, because the mean of its divisors is an integer number (10078436368).
Almost surely, 240303673101 is an apocalyptic number.
It is an amenable number.
40303673101 is a deficient number, since it is larger than the sum of its proper divisors (10072371).
40303673101 is a wasteful number, since it uses less digits than its factorization.
40303673101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10072370.
The product of its (nonzero) digits is 4536, while the sum is 28.
The spelling of 40303673101 in words is "forty billion, three hundred three million, six hundred seventy-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •