Base | Representation |
---|---|
bin | 10010011011110110111… |
… | …01010011100000010000 |
3 | 2020112222221001210201020 |
4 | 21031323131103200100 |
5 | 40334231424102034 |
6 | 1202554442435440 |
7 | 63523010450562 |
oct | 11157335234020 |
9 | 2215887053636 |
10 | 633431472144 |
11 | 224700609419 |
12 | a291ab02b80 |
13 | 47969c174a3 |
14 | 2293032d332 |
15 | 11724d69249 |
hex | 937b753810 |
633431472144 has 80 divisors (see below), whose sum is σ = 1734759593280. Its totient is φ = 198478356480.
The previous prime is 633431472131. The next prime is 633431472199. The reversal of 633431472144 is 441274134336.
It is a junction number, because it is equal to n+sod(n) for n = 633431472096 and 633431472105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 183192 + ... + 1140360.
It is an arithmetic number, because the mean of its divisors is an integer number (21684494916).
Almost surely, 2633431472144 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 633431472144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (867379796640).
633431472144 is an abundant number, since it is smaller than the sum of its proper divisors (1101328121136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
633431472144 is a wasteful number, since it uses less digits than its factorization.
633431472144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 958008 (or 958002 counting only the distinct ones).
The product of its digits is 580608, while the sum is 42.
The spelling of 633431472144 in words is "six hundred thirty-three billion, four hundred thirty-one million, four hundred seventy-two thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.285 sec. • engine limits •