Base | Representation |
---|---|
bin | 110111111100100011… |
… | …0100000101101101000 |
3 | 102111002222220120121010 |
4 | 1233321012200231220 |
5 | 3432023144210012 |
6 | 131105412543520 |
7 | 11452156426164 |
oct | 1577106405550 |
9 | 374088816533 |
10 | 120143350632 |
11 | 46a52875618 |
12 | 1b34b921ba0 |
13 | b438ac8826 |
14 | 5b5a3bdca4 |
15 | 31d286ec3c |
hex | 1bf91a0b68 |
120143350632 has 32 divisors (see below), whose sum is σ = 303733195200. Its totient is φ = 39597807744.
The previous prime is 120143350577. The next prime is 120143350681. The reversal of 120143350632 is 236053341021.
It is a self number, because there is not a number n which added to its sum of digits gives 120143350632.
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 7 ways as a sum of consecutive naturals, for example, 28121308 + ... + 28125579.
It is an arithmetic number, because the mean of its divisors is an integer number (9491662350).
Almost surely, 2120143350632 is an apocalyptic number.
120143350632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
120143350632 is an abundant number, since it is smaller than the sum of its proper divisors (183589844568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120143350632 is a wasteful number, since it uses less digits than its factorization.
120143350632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56246985 (or 56246981 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 120143350632 its reverse (236053341021), we get a palindrome (356196691653).
The spelling of 120143350632 in words is "one hundred twenty billion, one hundred forty-three million, three hundred fifty thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •