Base | Representation |
---|---|
bin | 1110101100101001011… |
… | …01001110001001000001 |
3 | 1210021111201222201002001 |
4 | 13112110231032021001 |
5 | 31233223022243001 |
6 | 1023555132224001 |
7 | 51325343435656 |
oct | 7262455161101 |
9 | 1707451881061 |
10 | 505006056001 |
11 | 185198831467 |
12 | 81a5960b001 |
13 | 38811319ca5 |
14 | 1a62a01dc2d |
15 | d20a384001 |
hex | 7594b4e241 |
505006056001 has 8 divisors (see below), whose sum is σ = 507520344744. Its totient is φ = 502497146880.
The previous prime is 505006055963. The next prime is 505006056011. The reversal of 505006056001 is 100650600505.
It can be written as a sum of positive squares in 4 ways, for example, as 330596250625 + 174409805376 = 574975^2 + 417624^2 .
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 505006056001 - 223 = 504997667393 is a prime.
It is a super-2 number, since 2×5050060560012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (505006056011) 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, 1156626 + ... + 1532251.
It is an arithmetic number, because the mean of its divisors is an integer number (63440043093).
Almost surely, 2505006056001 is an apocalyptic number.
It is an amenable number.
505006056001 is a deficient number, since it is larger than the sum of its proper divisors (2514288743).
505006056001 is a wasteful number, since it uses less digits than its factorization.
505006056001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2689811.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 505006056001 its reverse (100650600505), we get a palindrome (605656656506).
The spelling of 505006056001 in words is "five hundred five billion, six million, fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •