Base | Representation |
---|---|
bin | 10010010101111101100… |
… | …00101001011101110101 |
3 | 2020020211022000022210200 |
4 | 21022332300221131311 |
5 | 40311241001232023 |
6 | 1201312352111113 |
7 | 63351366423540 |
oct | 11127660513565 |
9 | 2206738008720 |
10 | 630265649013 |
11 | 223326589670 |
12 | a2196835499 |
13 | 47584083b70 |
14 | 2270dabd857 |
15 | 115dbe6c743 |
hex | 92bec29775 |
630265649013 has 96 divisors (see below), whose sum is σ = 1234202511360. Its totient is φ = 299290619520.
The previous prime is 630265649009. The next prime is 630265649053. The reversal of 630265649013 is 310946562036.
630265649013 is a `hidden beast` number, since 63 + 0 + 26 + 564 + 9 + 0 + 1 + 3 = 666.
It is not a de Polignac number, because 630265649013 - 22 = 630265649009 is a prime.
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 630265649013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (630265649003) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 588318 + ... + 1267536.
It is an arithmetic number, because the mean of its divisors is an integer number (12856276160).
Almost surely, 2630265649013 is an apocalyptic number.
630265649013 is a gapful number since it is divisible by the number (63) formed by its first and last digit.
It is an amenable number.
630265649013 is a deficient number, since it is larger than the sum of its proper divisors (603936862347).
630265649013 is a wasteful number, since it uses less digits than its factorization.
630265649013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 679359 (or 679356 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 45.
The spelling of 630265649013 in words is "six hundred thirty billion, two hundred sixty-five million, six hundred forty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •