Base | Representation |
---|---|
bin | 10010010101101101101… |
… | …00011110110001000000 |
3 | 2020020111000100101221120 |
4 | 21022312310132301000 |
5 | 40311002400423112 |
6 | 1201251232552240 |
7 | 63345161221521 |
oct | 11126664366100 |
9 | 2206430311846 |
10 | 630132436032 |
11 | 2232683727a0 |
12 | a215a0b2680 |
13 | 475625b1b08 |
14 | 226da124848 |
15 | 115d0406e8c |
hex | 92b6d1ec40 |
630132436032 has 112 divisors (see below), whose sum is σ = 1824641455104. Its totient is φ = 190335040000.
The previous prime is 630132436027. The next prime is 630132436049. The reversal of 630132436032 is 230634231036.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 630132435984 and 630132436002.
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, 177157 + ... + 1136507.
Almost surely, 2630132436032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 630132436032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (912320727552).
630132436032 is an abundant number, since it is smaller than the sum of its proper divisors (1194509019072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
630132436032 is a wasteful number, since it uses less digits than its factorization.
630132436032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 959688 (or 959678 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 33.
Adding to 630132436032 its reverse (230634231036), we get a palindrome (860766667068).
The spelling of 630132436032 in words is "six hundred thirty billion, one hundred thirty-two million, four hundred thirty-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •