Base | Representation |
---|---|
bin | 100101010011110… |
… | …100011001111101 |
3 | 1121121211200020112 |
4 | 211103310121331 |
5 | 2240220434011 |
6 | 142040155405 |
7 | 21340336025 |
oct | 4523643175 |
9 | 1547750215 |
10 | 625952381 |
11 | 2a137431a |
12 | 155768b65 |
13 | 9c8b4432 |
14 | 5d1c0a85 |
15 | 39e4758b |
hex | 254f467d |
625952381 has 4 divisors (see below), whose sum is σ = 626031264. Its totient is φ = 625873500.
The previous prime is 625952357. The next prime is 625952423. The reversal of 625952381 is 183259526.
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.
It is a cyclic number.
It is not a de Polignac number, because 625952381 - 26 = 625952317 is a prime.
It is a super-2 number, since 2×6259523812 = 783632766559138322, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (625952281) 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, 26015 + ... + 43916.
It is an arithmetic number, because the mean of its divisors is an integer number (156507816).
Almost surely, 2625952381 is an apocalyptic number.
It is an amenable number.
625952381 is a deficient number, since it is larger than the sum of its proper divisors (78883).
625952381 is an equidigital number, since it uses as much as digits as its factorization.
625952381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78882.
The product of its digits is 129600, while the sum is 41.
The square root of 625952381 is about 25019.0403692867. The cubic root of 625952381 is about 855.4220325656.
The spelling of 625952381 in words is "six hundred twenty-five million, nine hundred fifty-two thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •