Base | Representation |
---|---|
bin | 10010111101000100010… |
… | …11111111111010010100 |
3 | 2022021000111200120010000 |
4 | 21132202023333322110 |
5 | 41132240321203202 |
6 | 1215104001531300 |
7 | 65023600101651 |
oct | 11364213777224 |
9 | 2267014616100 |
10 | 651261116052 |
11 | 23121aa15818 |
12 | a6276043b30 |
13 | 4954ba6c641 |
14 | 23742292c28 |
15 | 11e1a2c191c |
hex | 97a22ffe94 |
651261116052 has 30 divisors (see below), whose sum is σ = 1702525202378. Its totient is φ = 217087038576.
The previous prime is 651261116039. The next prime is 651261116153. The reversal of 651261116052 is 250611162156.
It can be written as a sum of positive squares in only one way, i.e., 650339022096 + 922093956 = 806436^2 + 30366^2 .
It is a super-2 number, since 2×6512611160522 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 651261115998 and 651261116016.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1005032263 + ... + 1005032910.
Almost surely, 2651261116052 is an apocalyptic number.
It is an amenable number.
651261116052 is an abundant number, since it is smaller than the sum of its proper divisors (1051264086326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
651261116052 is a wasteful number, since it uses less digits than its factorization.
651261116052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2010065189 (or 2010065178 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
The spelling of 651261116052 in words is "six hundred fifty-one billion, two hundred sixty-one million, one hundred sixteen thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •