Base | Representation |
---|---|
bin | 10010110011100000101… |
… | …10101111000000111100 |
3 | 2021202202220210001111211 |
4 | 21121300112233000330 |
5 | 41041233301233312 |
6 | 1212454510254204 |
7 | 64452464152201 |
oct | 11316026570074 |
9 | 2252686701454 |
10 | 646130102332 |
11 | 22a027664210 |
12 | a52837b7364 |
13 | 48c11a2ba50 |
14 | 233b6a49ca8 |
15 | 11c19adb3a7 |
hex | 96705af03c |
646130102332 has 48 divisors (see below), whose sum is σ = 1334259626112. Its totient is φ = 269909196480.
The previous prime is 646130102281. The next prime is 646130102333. The reversal of 646130102332 is 233201031646.
It is a junction number, because it is equal to n+sod(n) for n = 646130102294 and 646130102303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (646130102333) 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 15 ways as a sum of consecutive naturals, for example, 2358258 + ... + 2617945.
It is an arithmetic number, because the mean of its divisors is an integer number (27797075544).
Almost surely, 2646130102332 is an apocalyptic number.
It is an amenable number.
646130102332 is an abundant number, since it is smaller than the sum of its proper divisors (688129523780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
646130102332 is a wasteful number, since it uses less digits than its factorization.
646130102332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4976458 (or 4976456 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 31.
Adding to 646130102332 its reverse (233201031646), we get a palindrome (879331133978).
The spelling of 646130102332 in words is "six hundred forty-six billion, one hundred thirty million, one hundred two thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •