Base | Representation |
---|---|
bin | 110100011011111101110011… |
… | …1011001011000001001010000 |
3 | 2020111010011010220220220211021 |
4 | 1220313323213121120021100 |
5 | 440423430340021404312 |
6 | 4312550531313125224 |
7 | 166103343406002142 |
oct | 15067734731301120 |
9 | 2214104126826737 |
10 | 461240420106832 |
11 | 123a68a66701363 |
12 | 43893597559814 |
13 | 16a49a287c7a02 |
14 | 81c8226792c92 |
15 | 384cdc61d9c07 |
hex | 1a37ee7658250 |
461240420106832 has 20 divisors (see below), whose sum is σ = 901561750367220. Its totient is φ = 228579323237888.
The previous prime is 461240420106769. The next prime is 461240420106953. The reversal of 461240420106832 is 238601024042164.
It can be written as a sum of positive squares in 2 ways, for example, as 23401367550016 + 437839052556816 = 4837496^2 + 20924604^2 .
It is a super-2 number, since 2×4612404201068322 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 127555424107 + ... + 127555427722.
It is an arithmetic number, because the mean of its divisors is an integer number (45078087518361).
Almost surely, 2461240420106832 is an apocalyptic number.
It is an amenable number.
461240420106832 is a deficient number, since it is larger than the sum of its proper divisors (440321330260388).
461240420106832 is a wasteful number, since it uses less digits than its factorization.
461240420106832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255110851950 (or 255110851944 counting only the distinct ones).
The product of its (nonzero) digits is 442368, while the sum is 43.
Adding to 461240420106832 its reverse (238601024042164), we get a palindrome (699841444148996).
The spelling of 461240420106832 in words is "four hundred sixty-one trillion, two hundred forty billion, four hundred twenty million, one hundred six thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •