Base | Representation |
---|---|
bin | 1000110011111111111111001… |
… | …0000011001010000001101111 |
3 | 10000022200022021100220212102022 |
4 | 2030333333302003022001233 |
5 | 1122240104103421342033 |
6 | 10034521103121420355 |
7 | 244422334562046626 |
oct | 21477776203120157 |
9 | 3008608240825368 |
10 | 620124324012143 |
11 | 16a65528132a455 |
12 | 596742b949a6bb |
13 | 2080361ba83892 |
14 | ad1c26ac0a6bd |
15 | 4ba5ccb933098 |
hex | 233fff20ca06f |
620124324012143 has 32 divisors (see below), whose sum is σ = 672665654329344. Its totient is φ = 569562344451072.
The previous prime is 620124324012043. The next prime is 620124324012157. The reversal of 620124324012143 is 341210423421026.
It is a cyclic number.
It is not a de Polignac number, because 620124324012143 - 226 = 620124256903279 is a prime.
It is a super-2 number, since 2×6201243240121432 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (620124324012043) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 52481246 + ... + 63202292.
It is an arithmetic number, because the mean of its divisors is an integer number (21020801697792).
Almost surely, 2620124324012143 is an apocalyptic number.
620124324012143 is a deficient number, since it is larger than the sum of its proper divisors (52541330317201).
620124324012143 is a wasteful number, since it uses less digits than its factorization.
620124324012143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10721631.
The product of its (nonzero) digits is 55296, while the sum is 35.
Adding to 620124324012143 its reverse (341210423421026), we get a palindrome (961334747433169).
The spelling of 620124324012143 in words is "six hundred twenty trillion, one hundred twenty-four billion, three hundred twenty-four million, twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •