Base | Representation |
---|---|
bin | 10010011110101000100101… |
… | …10000111011100101110101 |
3 | 12022212200001001012211101121 |
4 | 21033110102300323211311 |
5 | 20311230440100414331 |
6 | 222231243402423541 |
7 | 11362532122320640 |
oct | 1117242260734565 |
9 | 168780031184347 |
10 | 40635000404341 |
11 | 11a47230415472 |
12 | 4683403501bb1 |
13 | 1989b3055a9a5 |
14 | a06a5cd32a57 |
15 | 4a7022699c11 |
hex | 24f512c3b975 |
40635000404341 has 8 divisors (see below), whose sum is σ = 46540302842624. Its totient is φ = 34754773561200.
The previous prime is 40635000404183. The next prime is 40635000404353. The reversal of 40635000404341 is 14340400053604.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40635000404341 - 229 = 40634463533429 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40635000404297 and 40635000404306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40635000404741) 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, 6268895310 + ... + 6268901791.
It is an arithmetic number, because the mean of its divisors is an integer number (5817537855328).
Almost surely, 240635000404341 is an apocalyptic number.
It is an amenable number.
40635000404341 is a deficient number, since it is larger than the sum of its proper divisors (5905302438283).
40635000404341 is a wasteful number, since it uses less digits than its factorization.
40635000404341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12537797571.
The product of its (nonzero) digits is 69120, while the sum is 34.
Adding to 40635000404341 its reverse (14340400053604), we get a palindrome (54975400457945).
The spelling of 40635000404341 in words is "forty trillion, six hundred thirty-five billion, four hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •