Base | Representation |
---|---|
bin | 100111101011110101… |
… | …011110000001100000 |
3 | 11001222122210210000000 |
4 | 213223311132001200 |
5 | 1144232002234112 |
6 | 31324141300000 |
7 | 3035643436452 |
oct | 475365360140 |
9 | 131878723000 |
10 | 42611368032 |
11 | 17087008542 |
12 | 8312564600 |
13 | 40310a594c |
14 | 20c332c2d2 |
15 | 1195db07dc |
hex | 9ebd5e060 |
42611368032 has 96 divisors (see below), whose sum is σ = 125817723360. Its totient is φ = 14203766016.
The previous prime is 42611367949. The next prime is 42611368057. The reversal of 42611368032 is 23086311624.
42611368032 is a `hidden beast` number, since 4 + 2 + 611 + 3 + 6 + 8 + 0 + 32 = 666.
42611368032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
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, 234453 + ... + 374420.
It is an arithmetic number, because the mean of its divisors is an integer number (1310601285).
Almost surely, 242611368032 is an apocalyptic number.
It is an amenable number.
42611368032 is an abundant number, since it is smaller than the sum of its proper divisors (83206355328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42611368032 is an frugal number, since it uses more digits than its factorization.
42611368032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 608904 (or 608878 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 36.
Adding to 42611368032 its reverse (23086311624), we get a palindrome (65697679656).
The spelling of 42611368032 in words is "forty-two billion, six hundred eleven million, three hundred sixty-eight thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •