Base | Representation |
---|---|
bin | 10111111011010101100000… |
… | …01000010011110100010111 |
3 | 20220022001212201100200100110 |
4 | 23331222300020103310113 |
5 | 23344031142403004333 |
6 | 303523332503214103 |
7 | 14040255033416625 |
oct | 1375526010236427 |
9 | 226261781320313 |
10 | 52616304344343 |
11 | 158464a4109713 |
12 | 5a99485a47333 |
13 | 234890875a07c |
14 | cdc8dd894515 |
15 | 613a0e06c063 |
hex | 2fdab0213d17 |
52616304344343 has 4 divisors (see below), whose sum is σ = 70155072459128. Its totient is φ = 35077536229560.
The previous prime is 52616304344341. The next prime is 52616304344393. The reversal of 52616304344343 is 34344340361625.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 52616304344343 - 21 = 52616304344341 is a prime.
It is a super-2 number, since 2×526163043443432 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 52616304344292 and 52616304344301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52616304344341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8769384057388 + ... + 8769384057393.
It is an arithmetic number, because the mean of its divisors is an integer number (17538768114782).
Almost surely, 252616304344343 is an apocalyptic number.
52616304344343 is a deficient number, since it is larger than the sum of its proper divisors (17538768114785).
52616304344343 is a wasteful number, since it uses less digits than its factorization.
52616304344343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17538768114784.
The product of its (nonzero) digits is 7464960, while the sum is 48.
The spelling of 52616304344343 in words is "fifty-two trillion, six hundred sixteen billion, three hundred four million, three hundred forty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •