Base | Representation |
---|---|
bin | 10010101010011100001… |
… | …01100101000110101011 |
3 | 2021022012112020000202100 |
4 | 21111032011211012223 |
5 | 41001300103301101 |
6 | 1210331343504443 |
7 | 64221011605122 |
oct | 11251605450653 |
9 | 2238175200670 |
10 | 641260212651 |
11 | 227a58743aa3 |
12 | a43448b8123 |
13 | 48616b26c16 |
14 | 23073d76ab9 |
15 | 11a322d5e86 |
hex | 954e1651ab |
641260212651 has 48 divisors (see below), whose sum is σ = 951536222208. Its totient is φ = 416033755200.
The previous prime is 641260212629. The next prime is 641260212661. The reversal of 641260212651 is 156212062146.
641260212651 is a `hidden beast` number, since 6 + 41 + 2 + 602 + 1 + 2 + 6 + 5 + 1 = 666.
It is a de Polignac number, because none of the positive numbers 2k-641260212651 is a prime.
It is a super-2 number, since 2×6412602126512 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (641260212661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 15967086 + ... + 16007196.
It is an arithmetic number, because the mean of its divisors is an integer number (19823671296).
Almost surely, 2641260212651 is an apocalyptic number.
641260212651 is a deficient number, since it is larger than the sum of its proper divisors (310276009557).
641260212651 is a wasteful number, since it uses less digits than its factorization.
641260212651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40512 (or 40509 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
Adding to 641260212651 its reverse (156212062146), we get a palindrome (797472274797).
The spelling of 641260212651 in words is "six hundred forty-one billion, two hundred sixty million, two hundred twelve thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •