Base | Representation |
---|---|
bin | 10010011111101100100101… |
… | …00000101100111100111011 |
3 | 12100000011020222222201111010 |
4 | 21033312102200230330323 |
5 | 20312330214330401331 |
6 | 222300121500005003 |
7 | 11365263524402304 |
oct | 1117662240547473 |
9 | 170004228881433 |
10 | 40671503372091 |
11 | 11a60762393409 |
12 | 468a4b0230763 |
13 | 19903c9c726a7 |
14 | a08722cb57ab |
15 | 4a7e5c15de46 |
hex | 24fd9282cf3b |
40671503372091 has 8 divisors (see below), whose sum is σ = 54230700102480. Its totient is φ = 27113321111552.
The previous prime is 40671503372063. The next prime is 40671503372107. The reversal of 40671503372091 is 19027330517604.
It is a happy number.
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 40671503372091 - 219 = 40671502847803 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 40671503372091.
It is not an unprimeable number, because it can be changed into a prime (40671503872091) 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, 253523910 + ... + 253684283.
It is an arithmetic number, because the mean of its divisors is an integer number (6778837512810).
Almost surely, 240671503372091 is an apocalyptic number.
40671503372091 is a deficient number, since it is larger than the sum of its proper divisors (13559196730389).
40671503372091 is a wasteful number, since it uses less digits than its factorization.
40671503372091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 507234925.
The product of its (nonzero) digits is 952560, while the sum is 48.
Adding to 40671503372091 its reverse (19027330517604), we get a palindrome (59698833889695).
The spelling of 40671503372091 in words is "forty trillion, six hundred seventy-one billion, five hundred three million, three hundred seventy-two thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •