Base | Representation |
---|---|
bin | 10111111100010100110011… |
… | …00011011001101101011110 |
3 | 20220102022120220112112021100 |
4 | 23332022121203121231132 |
5 | 23400110241014340031 |
6 | 303551112425213530 |
7 | 14042600103021015 |
oct | 1376123143315536 |
9 | 226368526475240 |
10 | 52650285308766 |
11 | 15859951515192 |
12 | 5aa3b8a0312a6 |
13 | 234bb9280a402 |
14 | d004048d9a7c |
15 | 61484c40ade6 |
hex | 2fe2998d9b5e |
52650285308766 has 96 divisors (see below), whose sum is σ = 121927715769600. Its totient is φ = 16362328866048.
The previous prime is 52650285308759. The next prime is 52650285308771. The reversal of 52650285308766 is 66780358205625.
52650285308766 is a `hidden beast` number, since 5 + 2 + 6 + 5 + 0 + 28 + 530 + 8 + 76 + 6 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11918485 + ... + 15727391.
It is an arithmetic number, because the mean of its divisors is an integer number (1270080372600).
Almost surely, 252650285308766 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52650285308766, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60963857884800).
52650285308766 is an abundant number, since it is smaller than the sum of its proper divisors (69277430460834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52650285308766 is a wasteful number, since it uses less digits than its factorization.
52650285308766 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3809358 (or 3809355 counting only the distinct ones).
The product of its (nonzero) digits is 145152000, while the sum is 63.
The spelling of 52650285308766 in words is "fifty-two trillion, six hundred fifty billion, two hundred eighty-five million, three hundred eight thousand, seven hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •