Base | Representation |
---|---|
bin | 10010111100101011101… |
… | …11000110101011000100 |
3 | 2022020111002112211110120 |
4 | 21132111313012223010 |
5 | 41131324400442012 |
6 | 1215031253221540 |
7 | 65015506226040 |
oct | 11362567065304 |
9 | 2266432484416 |
10 | 651054312132 |
11 | 231124205994 |
12 | a62189318b0 |
13 | 49517c72463 |
14 | 23722a1d020 |
15 | 11e0707158c |
hex | 9795dc6ac4 |
651054312132 has 48 divisors (see below), whose sum is σ = 1827520880640. Its totient is φ = 176225226912.
The previous prime is 651054312127. The next prime is 651054312137. The reversal of 651054312132 is 231213450156.
It is an interprime number because it is at equal distance from previous prime (651054312127) and next prime (651054312137).
It is a junction number, because it is equal to n+sod(n) for n = 651054312093 and 651054312102.
It is not an unprimeable number, because it can be changed into a prime (651054312137) 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, 203962788 + ... + 203965979.
It is an arithmetic number, because the mean of its divisors is an integer number (38073351680).
Almost surely, 2651054312132 is an apocalyptic number.
It is an amenable number.
651054312132 is an abundant number, since it is smaller than the sum of its proper divisors (1176466568508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
651054312132 is a wasteful number, since it uses less digits than its factorization.
651054312132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 407928800 (or 407928798 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 651054312132 its reverse (231213450156), we get a palindrome (882267762288).
The spelling of 651054312132 in words is "six hundred fifty-one billion, fifty-four million, three hundred twelve thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •