Base | Representation |
---|---|
bin | 100111011100111111… |
… | …000011010001000000 |
3 | 11001100021222211101120 |
4 | 213130333003101000 |
5 | 1143224212043012 |
6 | 31243321232240 |
7 | 3026526641223 |
oct | 473477032100 |
9 | 131307884346 |
10 | 42362221632 |
11 | 16a69408125 |
12 | 8263032680 |
13 | 3cc15a1943 |
14 | 209c1d55ba |
15 | 117e09958c |
hex | 9dcfc3440 |
42362221632 has 112 divisors (see below), whose sum is σ = 112667491200. Its totient is φ = 14047395840.
The previous prime is 42362221553. The next prime is 42362221661. The reversal of 42362221632 is 23612226324.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 42362221593 and 42362221602.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45599344 + ... + 45600272.
Almost surely, 242362221632 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 42362221632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56333745600).
42362221632 is an abundant number, since it is smaller than the sum of its proper divisors (70305269568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42362221632 is a wasteful number, since it uses less digits than its factorization.
42362221632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1924 (or 1914 counting only the distinct ones).
The product of its digits is 41472, while the sum is 33.
Adding to 42362221632 its reverse (23612226324), we get a palindrome (65974447956).
The spelling of 42362221632 in words is "forty-two billion, three hundred sixty-two million, two hundred twenty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •