Base | Representation |
---|---|
bin | 10111111100000111010001… |
… | …00100110100100100110110 |
3 | 20220101121211122201211212120 |
4 | 23332003220210310210312 |
5 | 23400000401403141142 |
6 | 303543511533100410 |
7 | 14042222065453110 |
oct | 1376035044644466 |
9 | 226347748654776 |
10 | 52643021146422 |
11 | 15856864044533 |
12 | 5aa26a1327706 |
13 | 234b2a58737b5 |
14 | cddd15c583b0 |
15 | 6145748117ec |
hex | 2fe0e8934936 |
52643021146422 has 64 divisors (see below), whose sum is σ = 121268588120064. Its totient is φ = 14923267683840.
The previous prime is 52643021146411. The next prime is 52643021146439. The reversal of 52643021146422 is 22464112034625.
52643021146422 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
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 31 ways as a sum of consecutive naturals, for example, 8616147 + ... + 13398657.
It is an arithmetic number, because the mean of its divisors is an integer number (1894821689376).
Almost surely, 252643021146422 is an apocalyptic number.
52643021146422 is an abundant number, since it is smaller than the sum of its proper divisors (68625566973642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52643021146422 is a wasteful number, since it uses less digits than its factorization.
52643021146422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4784573.
The product of its (nonzero) digits is 552960, while the sum is 42.
The spelling of 52643021146422 in words is "fifty-two trillion, six hundred forty-three billion, twenty-one million, one hundred forty-six thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •