Base | Representation |
---|---|
bin | 10010010000000000010100… |
… | …00100000001011011100111 |
3 | 12021002121121000002012111122 |
4 | 21020000022010001123213 |
5 | 20230012014332143143 |
6 | 221204313255124155 |
7 | 11311315610034560 |
oct | 1110001204013347 |
9 | 167077530065448 |
10 | 40132343240423 |
11 | 11873038569435 |
12 | 4601b0067365b |
13 | 1951604a73b95 |
14 | 9ca5b6c6b167 |
15 | 498e03643c68 |
hex | 24800a1016e7 |
40132343240423 has 12 divisors (see below), whose sum is σ = 47392795414800. Its totient is φ = 33289501299840.
The previous prime is 40132343240417. The next prime is 40132343240441. The reversal of 40132343240423 is 32404234323104.
It is not a de Polignac number, because 40132343240423 - 212 = 40132343236327 is a prime.
It is a super-2 number, since 2×401323432404232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40132343240453) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2982923498 + ... + 2982936951.
It is an arithmetic number, because the mean of its divisors is an integer number (3949399617900).
Almost surely, 240132343240423 is an apocalyptic number.
40132343240423 is a deficient number, since it is larger than the sum of its proper divisors (7260452174377).
40132343240423 is an equidigital number, since it uses as much as digits as its factorization.
40132343240423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5965860518 (or 5965860487 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 35.
Adding to 40132343240423 its reverse (32404234323104), we get a palindrome (72536577563527).
The spelling of 40132343240423 in words is "forty trillion, one hundred thirty-two billion, three hundred forty-three million, two hundred forty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •