Base | Representation |
---|---|
bin | 100101111011110000… |
… | …011111010001011000 |
3 | 10220010121120220111200 |
4 | 211323300133101120 |
5 | 1131404114423412 |
6 | 30413410554200 |
7 | 2641231623426 |
oct | 457360372130 |
9 | 126117526450 |
10 | 40731014232 |
11 | 16301660937 |
12 | 7a88898960 |
13 | 3ac166046c |
14 | 1d856da116 |
15 | 10d5c839dc |
hex | 97bc1f458 |
40731014232 has 24 divisors (see below), whose sum is σ = 110313163740. Its totient is φ = 13577004720.
The previous prime is 40731014231. The next prime is 40731014273. The reversal of 40731014232 is 23241013704.
It is a happy number.
40731014232 is a `hidden beast` number, since 407 + 3 + 10 + 14 + 232 = 666.
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 40731014196 and 40731014205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40731014231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 282854194 + ... + 282854337.
Almost surely, 240731014232 is an apocalyptic number.
It is an amenable number.
40731014232 is an abundant number, since it is smaller than the sum of its proper divisors (69582149508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40731014232 is a wasteful number, since it uses less digits than its factorization.
40731014232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565708543 (or 565708536 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
Adding to 40731014232 its reverse (23241013704), we get a palindrome (63972027936).
The spelling of 40731014232 in words is "forty billion, seven hundred thirty-one million, fourteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •