Base | Representation |
---|---|
bin | 11110010001101… |
… | …110000000110101 |
3 | 1022101211010001002 |
4 | 132101232000311 |
5 | 2020014231042 |
6 | 122223213045 |
7 | 15405413006 |
oct | 3621560065 |
9 | 1271733032 |
10 | 507961397 |
11 | 240804a09 |
12 | 122147185 |
13 | 81311a98 |
14 | 4b6691ad |
15 | 2e8dc132 |
hex | 1e46e035 |
507961397 has 4 divisors (see below), whose sum is σ = 509345856. Its totient is φ = 506576940.
The previous prime is 507961369. The next prime is 507961403. The reversal of 507961397 is 793169705.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 793169705 = 5 ⋅158633941.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-507961397 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (507961327) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 691679 + ... + 692412.
It is an arithmetic number, because the mean of its divisors is an integer number (127336464).
Almost surely, 2507961397 is an apocalyptic number.
It is an amenable number.
507961397 is a deficient number, since it is larger than the sum of its proper divisors (1384459).
507961397 is a wasteful number, since it uses less digits than its factorization.
507961397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1384458.
The product of its (nonzero) digits is 357210, while the sum is 47.
The square root of 507961397 is about 22537.9989573165. The cubic root of 507961397 is about 797.8910060036.
Adding to 507961397 its sum of digits (47), we get a square (507961444 = 225382).
The spelling of 507961397 in words is "five hundred seven million, nine hundred sixty-one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •