Base | Representation |
---|---|
bin | 111001101001010010110010… |
… | …1111010111111100001011111 |
3 | 2110111022202112222012101202212 |
4 | 1303102211211322333201133 |
5 | 1012430022323442332411 |
6 | 4554224440024111035 |
7 | 211542226462161110 |
oct | 16322454572774137 |
9 | 2414282488171685 |
10 | 507052664027231 |
11 | 13762091100a263 |
12 | 48a5225330547b |
13 | 189c0b2695bcba |
14 | 8d2d6a0b30207 |
15 | 3d9490b7bd68b |
hex | 1cd2965ebf85f |
507052664027231 has 16 divisors (see below), whose sum is σ = 580060770710784. Its totient is φ = 434187655340544.
The previous prime is 507052664027227. The next prime is 507052664027243. The reversal of 507052664027231 is 132720466250705.
It is not a de Polignac number, because 507052664027231 - 22 = 507052664027227 is a prime.
It is a super-2 number, since 2×5070526640272312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 507052664027231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (507052664027201) 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, 60138560 + ... + 68049626.
It is an arithmetic number, because the mean of its divisors is an integer number (36253798169424).
Almost surely, 2507052664027231 is an apocalyptic number.
507052664027231 is a deficient number, since it is larger than the sum of its proper divisors (73008106683553).
507052664027231 is a wasteful number, since it uses less digits than its factorization.
507052664027231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7920110.
The product of its (nonzero) digits is 4233600, while the sum is 50.
The spelling of 507052664027231 in words is "five hundred seven trillion, fifty-two billion, six hundred sixty-four million, twenty-seven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •