Base | Representation |
---|---|
bin | 10111101101010101000011… |
… | …11101001001100101000011 |
3 | 20211121001121220011000210021 |
4 | 23312222201331021211003 |
5 | 23313140020212410033 |
6 | 302514300252114311 |
7 | 13660426435613425 |
oct | 1366524175114503 |
9 | 224531556130707 |
10 | 52135030200643 |
11 | 15680384433215 |
12 | 5a20150165997 |
13 | 231240a032b50 |
14 | cc34c5646815 |
15 | 6062423c0b2d |
hex | 2f6aa1f49943 |
52135030200643 has 16 divisors (see below), whose sum is σ = 56784799159200. Its totient is φ = 47576764097280.
The previous prime is 52135030200641. The next prime is 52135030200677. The reversal of 52135030200643 is 34600203053125.
It is a cyclic number.
It is not a de Polignac number, because 52135030200643 - 21 = 52135030200641 is a prime.
It is a super-2 number, since 2×521350302006432 (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 = 52135030200599 and 52135030200608.
It is not an unprimeable number, because it can be changed into a prime (52135030200641) 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, 4321033 + ... + 11087893.
It is an arithmetic number, because the mean of its divisors is an integer number (3549049947450).
Almost surely, 252135030200643 is an apocalyptic number.
52135030200643 is a deficient number, since it is larger than the sum of its proper divisors (4649768958557).
52135030200643 is a wasteful number, since it uses less digits than its factorization.
52135030200643 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6773622.
The product of its (nonzero) digits is 64800, while the sum is 34.
Adding to 52135030200643 its reverse (34600203053125), we get a palindrome (86735233253768).
The spelling of 52135030200643 in words is "fifty-two trillion, one hundred thirty-five billion, thirty million, two hundred thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •