Base | Representation |
---|---|
bin | 10010011001110000010… |
… | …01000110011001111100 |
3 | 2020110002012221212022120 |
4 | 21030320021012121330 |
5 | 40324423314232030 |
6 | 1202250420242540 |
7 | 63453015121632 |
oct | 11147011063174 |
9 | 2213065855276 |
10 | 632302102140 |
11 | 224181063a85 |
12 | a2664840450 |
13 | 47819c52507 |
14 | 22864347352 |
15 | 116aab31010 |
hex | 933824667c |
632302102140 has 48 divisors (see below), whose sum is σ = 1782170718720. Its totient is φ = 167497243200.
The previous prime is 632302102129. The next prime is 632302102141. The reversal of 632302102140 is 41201203236.
It is a self number, because there is not a number n which added to its sum of digits gives 632302102140.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (632302102141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34886200 + ... + 34904319.
It is an arithmetic number, because the mean of its divisors is an integer number (37128556640).
Almost surely, 2632302102140 is an apocalyptic number.
632302102140 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
632302102140 is an abundant number, since it is smaller than the sum of its proper divisors (1149868616580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
632302102140 is a wasteful number, since it uses less digits than its factorization.
632302102140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69790682 (or 69790680 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 632302102140 its reverse (41201203236), we get a palindrome (673503305376).
The spelling of 632302102140 in words is "six hundred thirty-two billion, three hundred two million, one hundred two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •