Base | Representation |
---|---|
bin | 1110101010110111110… |
… | …11101011000001011001 |
3 | 1210012001100200000212210 |
4 | 13111123323223001121 |
5 | 31224300201334001 |
6 | 1023320424425333 |
7 | 51262626265101 |
oct | 7253373530131 |
9 | 1705040600783 |
10 | 504053543001 |
11 | 18484a0a2338 |
12 | 81832618249 |
13 | 386bbb98428 |
14 | 1a579714201 |
15 | d1a1932dd6 |
hex | 755beeb059 |
504053543001 has 8 divisors (see below), whose sum is σ = 672551790400. Its totient is φ = 335795495472.
The previous prime is 504053542981. The next prime is 504053543009. The reversal of 504053543001 is 100345350405.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 504053543001 - 214 = 504053526617 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 504053543001.
It is not an unprimeable number, because it can be changed into a prime (504053543009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60045070 + ... + 60053463.
It is an arithmetic number, because the mean of its divisors is an integer number (84068973800).
Almost surely, 2504053543001 is an apocalyptic number.
It is an amenable number.
504053543001 is a deficient number, since it is larger than the sum of its proper divisors (168498247399).
504053543001 is a wasteful number, since it uses less digits than its factorization.
504053543001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120099935.
The product of its (nonzero) digits is 18000, while the sum is 30.
Adding to 504053543001 its reverse (100345350405), we get a palindrome (604398893406).
The spelling of 504053543001 in words is "five hundred four billion, fifty-three million, five hundred forty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •