Base | Representation |
---|---|
bin | 1110101101000011001… |
… | …01100001001011100101 |
3 | 1210022001210120221111000 |
4 | 13112201211201023211 |
5 | 31234143332000040 |
6 | 1024032411503513 |
7 | 51333606224235 |
oct | 7264145411345 |
9 | 1708053527430 |
10 | 505222140645 |
11 | 185299800012 |
12 | 81ab9a57b99 |
13 | 38847016521 |
14 | 1a64a9cbcc5 |
15 | d21e319130 |
hex | 75a19612e5 |
505222140645 has 32 divisors (see below), whose sum is σ = 903135018240. Its totient is φ = 267963111360.
The previous prime is 505222140623. The next prime is 505222140649. The reversal of 505222140645 is 546041222505.
505222140645 is a `hidden beast` number, since 5 + 0 + 5 + 2 + 2 + 2 + 1 + 4 + 0 + 645 = 666.
It is not a de Polignac number, because 505222140645 - 26 = 505222140581 is a prime.
It is a super-2 number, since 2×5052221406452 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505222140649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10313649 + ... + 10362518.
It is an arithmetic number, because the mean of its divisors is an integer number (28222969320).
Almost surely, 2505222140645 is an apocalyptic number.
It is an amenable number.
505222140645 is a deficient number, since it is larger than the sum of its proper divisors (397912877595).
505222140645 is a wasteful number, since it uses less digits than its factorization.
505222140645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20676362 (or 20676356 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 36.
The spelling of 505222140645 in words is "five hundred five billion, two hundred twenty-two million, one hundred forty thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •