Base | Representation |
---|---|
bin | 1111001000111111010… |
… | …01111110011001111111 |
3 | 1211201210011201212022211 |
4 | 13210133221332121333 |
5 | 32010403331440111 |
6 | 1034553045521251 |
7 | 52404406141666 |
oct | 7443751763177 |
9 | 1751704655284 |
10 | 520222140031 |
11 | 190696921620 |
12 | 849a5413227 |
13 | 3a0978621c9 |
14 | 1b270c11ddd |
15 | d7eb12d521 |
hex | 791fa7e67f |
520222140031 has 8 divisors (see below), whose sum is σ = 570395851344. Its totient is φ = 470528560320.
The previous prime is 520222139963. The next prime is 520222140049. The reversal of 520222140031 is 130041222025.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 520222140031 - 219 = 520221615743 is a prime.
It is a super-2 number, since 2×5202221400312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 520222139984 and 520222140011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (520225140031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 120030630 + ... + 120034963.
It is an arithmetic number, because the mean of its divisors is an integer number (71299481418).
Almost surely, 2520222140031 is an apocalyptic number.
520222140031 is a deficient number, since it is larger than the sum of its proper divisors (50173711313).
520222140031 is a wasteful number, since it uses less digits than its factorization.
520222140031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240065801.
The product of its (nonzero) digits is 960, while the sum is 22.
Adding to 520222140031 its reverse (130041222025), we get a palindrome (650263362056).
The spelling of 520222140031 in words is "five hundred twenty billion, two hundred twenty-two million, one hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •