Base | Representation |
---|---|
bin | 111101010010110100111… |
… | …110000000001000110100 |
3 | 112220200011202222111111101 |
4 | 331102310332000020310 |
5 | 1023002342122234302 |
6 | 12543003001015444 |
7 | 613212603063421 |
oct | 75226476001064 |
9 | 15820152874441 |
10 | 4212104102452 |
11 | 1384385a58124 |
12 | 580401184584 |
13 | 2472799cb2bc |
14 | 107c1cbbad48 |
15 | 74876db5287 |
hex | 3d4b4f80234 |
4212104102452 has 12 divisors (see below), whose sum is σ = 7804781131140. Its totient is φ = 1982166636416.
The previous prime is 4212104102431. The next prime is 4212104102467. The reversal of 4212104102452 is 2542014012124.
It can be written as a sum of positive squares in 2 ways, for example, as 1947548638116 + 2264555464336 = 1395546^2 + 1504844^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 4212104102452.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30971353627 + ... + 30971353762.
It is an arithmetic number, because the mean of its divisors is an integer number (650398427595).
Almost surely, 24212104102452 is an apocalyptic number.
It is an amenable number.
4212104102452 is a deficient number, since it is larger than the sum of its proper divisors (3592677028688).
4212104102452 is a wasteful number, since it uses less digits than its factorization.
4212104102452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61942707410 (or 61942707408 counting only the distinct ones).
The product of its (nonzero) digits is 5120, while the sum is 28.
Adding to 4212104102452 its reverse (2542014012124), we get a palindrome (6754118114576).
The spelling of 4212104102452 in words is "four trillion, two hundred twelve billion, one hundred four million, one hundred two thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •