Base | Representation |
---|---|
bin | 1110101101000000101… |
… | …00111001010001001010 |
3 | 1210022000022211011201010 |
4 | 13112200110321101022 |
5 | 31234122424140032 |
6 | 1024030334504350 |
7 | 51333231460164 |
oct | 7264024712112 |
9 | 1708008734633 |
10 | 505201005642 |
11 | 185288884a73 |
12 | 81ab29650b6 |
13 | 388428265c8 |
14 | 1a647c89934 |
15 | d21c541ccc |
hex | 75a053944a |
505201005642 has 8 divisors (see below), whose sum is σ = 1010402011296. Its totient is φ = 168400335212.
The previous prime is 505201005607. The next prime is 505201005643. The reversal of 505201005642 is 246500102505.
It is a sphenic number, since it is the product of 3 distinct primes.
505201005642 is an admirable number.
It is a super-2 number, since 2×5052010056422 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (505201005643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42100083798 + ... + 42100083809.
It is an arithmetic number, because the mean of its divisors is an integer number (126300251412).
Almost surely, 2505201005642 is an apocalyptic number.
505201005642 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505201005642 is a wasteful number, since it uses less digits than its factorization.
505201005642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84200167612.
The product of its (nonzero) digits is 12000, while the sum is 30.
The spelling of 505201005642 in words is "five hundred five billion, two hundred one million, five thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •