Base | Representation |
---|---|
bin | 1001000111001101110110110… |
… | …1100110100011000101101111 |
3 | 10010002111012221220001200120022 |
4 | 2101303131231212203011233 |
5 | 1133022243320300011211 |
6 | 10151455415032312355 |
7 | 252033011403225323 |
oct | 22163355546430557 |
9 | 3102435856050508 |
10 | 641253341016431 |
11 | 176361018622260 |
12 | 5bb0723a5426bb |
13 | 216a6c136724b0 |
14 | b44cb821b7983 |
15 | 4e2070e920bdb |
hex | 247376d9a316f |
641253341016431 has 16 divisors (see below), whose sum is σ = 753361325918208. Its totient is φ = 538114150725600.
The previous prime is 641253341016389. The next prime is 641253341016517. The reversal of 641253341016431 is 134610143352146.
It is a cyclic number.
It is not a de Polignac number, because 641253341016431 - 26 = 641253341016367 is a prime.
It is a super-2 number, since 2×6412533410164312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (641253341016331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 210302330 + ... + 213329736.
It is an arithmetic number, because the mean of its divisors is an integer number (47085082869888).
Almost surely, 2641253341016431 is an apocalyptic number.
641253341016431 is a deficient number, since it is larger than the sum of its proper divisors (112107984901777).
641253341016431 is a wasteful number, since it uses less digits than its factorization.
641253341016431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4508662.
The product of its (nonzero) digits is 622080, while the sum is 44.
Adding to 641253341016431 its reverse (134610143352146), we get a palindrome (775863484368577).
The spelling of 641253341016431 in words is "six hundred forty-one trillion, two hundred fifty-three billion, three hundred forty-one million, sixteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •