Base | Representation |
---|---|
bin | 1001000111001110010111001… |
… | …1100101111011101111100001 |
3 | 10010002112001101112122121121001 |
4 | 2101303211303211323233201 |
5 | 1133022414120023000103 |
6 | 10151503413234432001 |
7 | 252033436636556455 |
oct | 22163456345735741 |
9 | 3102461345577531 |
10 | 641262031453153 |
11 | 1763647780a7a70 |
12 | 5bb08a64a32601 |
13 | 216a7999c56b46 |
14 | b44d36844a665 |
15 | 4e20a6c85001d |
hex | 247397397bbe1 |
641262031453153 has 16 divisors (see below), whose sum is σ = 700184326165632. Its totient is φ = 582444055296000.
The previous prime is 641262031453063. The next prime is 641262031453159. The reversal of 641262031453153 is 351354130262146.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 641262031453153 - 225 = 641261997898721 is a prime.
It is a super-2 number, since 2×6412620314531532 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (641262031453159) 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 15 ways as a sum of consecutive naturals, for example, 479523348 + ... + 480858778.
It is an arithmetic number, because the mean of its divisors is an integer number (43761520385352).
Almost surely, 2641262031453153 is an apocalyptic number.
It is an amenable number.
641262031453153 is a deficient number, since it is larger than the sum of its proper divisors (58922294712479).
641262031453153 is a wasteful number, since it uses less digits than its factorization.
641262031453153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1374456.
The product of its (nonzero) digits is 1555200, while the sum is 46.
The spelling of 641262031453153 in words is "six hundred forty-one trillion, two hundred sixty-two billion, thirty-one million, four hundred fifty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •