Base | Representation |
---|---|
bin | 10010010101110011110… |
… | …00011000111110101000 |
3 | 2020020121120222120211220 |
4 | 21022321320120332220 |
5 | 40311104022330202 |
6 | 1201300305422040 |
7 | 63346353566136 |
oct | 11127170307650 |
9 | 2206546876756 |
10 | 630183792552 |
11 | 22329435a6a6 |
12 | a217333a920 |
13 | 475701237a2 |
14 | 22702c92756 |
15 | 115d4b9dabc |
hex | 92b9e18fa8 |
630183792552 has 64 divisors (see below), whose sum is σ = 1669787913600. Its totient is φ = 197508648960.
The previous prime is 630183792529. The next prime is 630183792571. The reversal of 630183792552 is 255297381036.
630183792552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×6301837925522 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 630183792495 and 630183792504.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 353724 + ... + 1177067.
It is an arithmetic number, because the mean of its divisors is an integer number (26090436150).
Almost surely, 2630183792552 is an apocalyptic number.
It is an amenable number.
630183792552 is an abundant number, since it is smaller than the sum of its proper divisors (1039604121048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
630183792552 is a wasteful number, since it uses less digits than its factorization.
630183792552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1531826 (or 1531822 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 51.
The spelling of 630183792552 in words is "six hundred thirty billion, one hundred eighty-three million, seven hundred ninety-two thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •