Base | Representation |
---|---|
bin | 10010010110001110001… |
… | …01000000001110001111 |
3 | 2020021012000121101122121 |
4 | 21023013011000032033 |
5 | 40312032212442311 |
6 | 1201334255153411 |
7 | 63355012545145 |
oct | 11130705001617 |
9 | 2207160541577 |
10 | 630405202831 |
11 | 2233983364a8 |
12 | a2215515867 |
13 | 475a6c660a1 |
14 | 22724449595 |
15 | 115e9336b71 |
hex | 92c714038f |
630405202831 has 8 divisors (see below), whose sum is σ = 634970336000. Its totient is φ = 625840496280.
The previous prime is 630405202811. The next prime is 630405202927. The reversal of 630405202831 is 138202504036.
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 630405202831 - 211 = 630405200783 is a prime.
It is a super-2 number, since 2×6304052028312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (630405202811) 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 7 ways as a sum of consecutive naturals, for example, 3237370 + ... + 3426568.
It is an arithmetic number, because the mean of its divisors is an integer number (79371292000).
Almost surely, 2630405202831 is an apocalyptic number.
630405202831 is a deficient number, since it is larger than the sum of its proper divisors (4565133169).
630405202831 is a wasteful number, since it uses less digits than its factorization.
630405202831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213309.
The product of its (nonzero) digits is 34560, while the sum is 34.
Adding to 630405202831 its reverse (138202504036), we get a palindrome (768607706867).
The spelling of 630405202831 in words is "six hundred thirty billion, four hundred five million, two hundred two thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •