Base | Representation |
---|---|
bin | 100110001110110… |
… | …100110011101011 |
3 | 1122200221112112200 |
4 | 212032310303223 |
5 | 2303200424043 |
6 | 143351511243 |
7 | 21615661452 |
oct | 4616646353 |
9 | 1580845480 |
10 | 641420523 |
11 | 2aa079807 |
12 | 15a988523 |
13 | a2b6bb93 |
14 | 61289b99 |
15 | 3b4a07d3 |
hex | 263b4ceb |
641420523 has 24 divisors (see below), whose sum is σ = 1004932656. Its totient is φ = 392640000.
The previous prime is 641420503. The next prime is 641420531. The reversal of 641420523 is 325024146.
It is not a de Polignac number, because 641420523 - 26 = 641420459 is a prime.
It is a super-2 number, since 2×6414205232 = 822840574651187058, which contains 22 as substring.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (641420503) 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 23 ways as a sum of consecutive naturals, for example, 44853 + ... + 57398.
It is an arithmetic number, because the mean of its divisors is an integer number (41872194).
Almost surely, 2641420523 is an apocalyptic number.
641420523 is a deficient number, since it is larger than the sum of its proper divisors (363512133).
641420523 is a wasteful number, since it uses less digits than its factorization.
641420523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102315 (or 102312 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 641420523 is about 25326.2812706485. The cubic root of 641420523 is about 862.4109932096.
Adding to 641420523 its reverse (325024146), we get a palindrome (966444669).
The spelling of 641420523 in words is "six hundred forty-one million, four hundred twenty thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •