Base | Representation |
---|---|
bin | 10010010000010001010001… |
… | …11001010111010010011100 |
3 | 12021010111002200221122020002 |
4 | 21020020220321113102130 |
5 | 20230134142310142102 |
6 | 221212421110513432 |
7 | 11312060364201062 |
oct | 1110105071272234 |
9 | 167114080848202 |
10 | 40141450474652 |
11 | 1187699134229a |
12 | 4603822665878 |
13 | 19524267cb687 |
14 | 9cabdc5d8032 |
15 | 499287e53902 |
hex | 248228e5749c |
40141450474652 has 12 divisors (see below), whose sum is σ = 70248203959416. Its totient is φ = 20070535057680.
The previous prime is 40141450474633. The next prime is 40141450474679. The reversal of 40141450474652 is 25647405414104.
It is a super-2 number, since 2×401414504746522 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40141450474597 and 40141450474606.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 47069474 + ... + 47914697.
It is an arithmetic number, because the mean of its divisors is an integer number (5854016996618).
Almost surely, 240141450474652 is an apocalyptic number.
It is an amenable number.
40141450474652 is a deficient number, since it is larger than the sum of its proper divisors (30106753484764).
40141450474652 is a wasteful number, since it uses less digits than its factorization.
40141450474652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95089828 (or 95089826 counting only the distinct ones).
The product of its (nonzero) digits is 2150400, while the sum is 47.
Adding to 40141450474652 its reverse (25647405414104), we get a palindrome (65788855888756).
The spelling of 40141450474652 in words is "forty trillion, one hundred forty-one billion, four hundred fifty million, four hundred seventy-four thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •