Base | Representation |
---|---|
bin | 100111100001110111… |
… | …110100011110000111 |
3 | 11001120000021101011200 |
4 | 213201313310132013 |
5 | 1143411204241403 |
6 | 31255410433543 |
7 | 3031543564416 |
oct | 474167643607 |
9 | 131500241150 |
10 | 42444212103 |
11 | 17000718847 |
12 | 82865928b3 |
13 | 400557b007 |
14 | 20a905947d |
15 | 1186392ca3 |
hex | 9e1df4787 |
42444212103 has 12 divisors (see below), whose sum is σ = 64914677568. Its totient is φ = 26631662400.
The previous prime is 42444212093. The next prime is 42444212113. The reversal of 42444212103 is 30121244424.
42444212103 is a `hidden beast` number, since 4 + 2 + 4 + 442 + 1 + 210 + 3 = 666.
It is an interprime number because it is at equal distance from previous prime (42444212093) and next prime (42444212113).
It is not a de Polignac number, because 42444212103 - 25 = 42444212071 is a prime.
It is a super-2 number, since 2×424442121032 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42444212113) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 138706423 + ... + 138706728.
It is an arithmetic number, because the mean of its divisors is an integer number (5409556464).
Almost surely, 242444212103 is an apocalyptic number.
42444212103 is a deficient number, since it is larger than the sum of its proper divisors (22470465465).
42444212103 is a wasteful number, since it uses less digits than its factorization.
42444212103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277413174 (or 277413171 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 27.
Adding to 42444212103 its reverse (30121244424), we get a palindrome (72565456527).
The spelling of 42444212103 in words is "forty-two billion, four hundred forty-four million, two hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •