Base | Representation |
---|---|
bin | 10011010010010100101011… |
… | …11111000001000110111100 |
3 | 12120011110021010211020211011 |
4 | 21221022111333001012330 |
5 | 21024330233442434000 |
6 | 230111204415205004 |
7 | 11635044460620211 |
oct | 1151122577010674 |
9 | 176143233736734 |
10 | 42411023405500 |
11 | 12571461071a32 |
12 | 490b659b16764 |
13 | 1a8845b19acc9 |
14 | a689c1171b08 |
15 | 4d831c2572ba |
hex | 269295fc11bc |
42411023405500 has 48 divisors (see below), whose sum is σ = 92663345829600. Its totient is φ = 16957509964800.
The previous prime is 42411023405497. The next prime is 42411023405537. The reversal of 42411023405500 is 550432011424.
42411023405500 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16017765 + ... + 18476764.
It is an arithmetic number, because the mean of its divisors is an integer number (1930486371450).
Almost surely, 242411023405500 is an apocalyptic number.
It is an amenable number.
42411023405500 is an abundant number, since it is smaller than the sum of its proper divisors (50252322424100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42411023405500 is a wasteful number, since it uses less digits than its factorization.
42411023405500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34497007 (or 34496995 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 42411023405500 its reverse (550432011424), we get a palindrome (42961455416924).
The spelling of 42411023405500 in words is "forty-two trillion, four hundred eleven billion, twenty-three million, four hundred five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •