Base | Representation |
---|---|
bin | 101110111101001001011000… |
… | …0101111101110000111111100 |
3 | 2000011101201122122222220201222 |
4 | 1131322102300233232013330 |
5 | 413113442030242233002 |
6 | 4022232410453052512 |
7 | 152666004500206616 |
oct | 13572226057560774 |
9 | 2004351578886658 |
10 | 413024200352252 |
11 | 10a669641642205 |
12 | 3a3a6a35027138 |
13 | 14960026b80c18 |
14 | 73dc69973ddb6 |
15 | 32b3a921801a2 |
hex | 177a4b0bee1fc |
413024200352252 has 24 divisors (see below), whose sum is σ = 722972683240080. Its totient is φ = 206460582376320.
The previous prime is 413024200352251. The next prime is 413024200352327. The reversal of 413024200352252 is 252253002420314.
It is a super-2 number, since 2×4130242003522522 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413024200352251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 287341502 + ... + 288775322.
It is an arithmetic number, because the mean of its divisors is an integer number (30123861801670).
Almost surely, 2413024200352252 is an apocalyptic number.
It is an amenable number.
413024200352252 is a deficient number, since it is larger than the sum of its proper divisors (309948482887828).
413024200352252 is a wasteful number, since it uses less digits than its factorization.
413024200352252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1451741 (or 1451739 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 35.
Adding to 413024200352252 its reverse (252253002420314), we get a palindrome (665277202772566).
The spelling of 413024200352252 in words is "four hundred thirteen trillion, twenty-four billion, two hundred million, three hundred fifty-two thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •