Base | Representation |
---|---|
bin | 10010101010101110101… |
… | …00000100010100001011 |
3 | 2021022121022111022120000 |
4 | 21111113110010110023 |
5 | 41002104220133301 |
6 | 1210354553334043 |
7 | 64224601406103 |
oct | 11252724042413 |
9 | 2238538438500 |
10 | 641415005451 |
11 | 22802805a130 |
12 | a4388707323 |
13 | 4863cc134ac |
14 | 2308a74c203 |
15 | 11a40bb0786 |
hex | 955750450b |
641415005451 has 40 divisors (see below), whose sum is σ = 1045351137600. Its totient is φ = 388705782960.
The previous prime is 641415005447. The next prime is 641415005453. The reversal of 641415005451 is 154500514146.
641415005451 is a `hidden beast` number, since 6 + 4 + 141 + 500 + 5 + 4 + 5 + 1 = 666.
It is not a de Polignac number, because 641415005451 - 22 = 641415005447 is a prime.
It is a super-2 number, since 2×6414150054512 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (641415005453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 17141080 + ... + 17178458.
It is an arithmetic number, because the mean of its divisors is an integer number (26133778440).
Almost surely, 2641415005451 is an apocalyptic number.
641415005451 is a deficient number, since it is larger than the sum of its proper divisors (403936132149).
641415005451 is a wasteful number, since it uses less digits than its factorization.
641415005451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56661 (or 56652 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 36.
Adding to 641415005451 its reverse (154500514146), we get a palindrome (795915519597).
The spelling of 641415005451 in words is "six hundred forty-one billion, four hundred fifteen million, five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •