Base | Representation |
---|---|
bin | 110000100001101111… |
… | …1000100000000010010 |
3 | 100221222200012020010000 |
4 | 1201003133010000102 |
5 | 3201411111301232 |
6 | 115512444350430 |
7 | 10346312360166 |
oct | 1410337040022 |
9 | 327880166100 |
10 | 104211431442 |
11 | 402176aa958 |
12 | 18244245416 |
13 | 9a9a18b701 |
14 | 50884d0ca6 |
15 | 2a9dd2627c |
hex | 18437c4012 |
104211431442 has 40 divisors (see below), whose sum is σ = 237338868492. Its totient is φ = 34167679200.
The previous prime is 104211431411. The next prime is 104211431447. The reversal of 104211431442 is 244134112401.
104211431442 is a `hidden beast` number, since 1 + 0 + 4 + 211 + 4 + 3 + 1 + 442 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 97750647801 + 6460783641 = 312651^2 + 80379^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (104211431447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 5262909 + ... + 5282672.
Almost surely, 2104211431442 is an apocalyptic number.
104211431442 is an abundant number, since it is smaller than the sum of its proper divisors (133127437050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104211431442 is a wasteful number, since it uses less digits than its factorization.
104211431442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10545656 (or 10545647 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 104211431442 its reverse (244134112401), we get a palindrome (348345543843).
The spelling of 104211431442 in words is "one hundred four billion, two hundred eleven million, four hundred thirty-one thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •