Base | Representation |
---|---|
bin | 111101010011001110011… |
… | …011000110111110100011 |
3 | 112220201021112120102111022 |
4 | 331103032123012332203 |
5 | 1023004230434204133 |
6 | 12543113214240055 |
7 | 613226310042140 |
oct | 75231633067643 |
9 | 15821245512438 |
10 | 4212531163043 |
11 | 1384585026065 |
12 | 5805001b602b |
13 | 247317325988 |
14 | 107c5d7c73c7 |
15 | 7489e621998 |
hex | 3d4ce6c6fa3 |
4212531163043 has 16 divisors (see below), whose sum is σ = 4951288869120. Its totient is φ = 3508867839456.
The previous prime is 4212531163007. The next prime is 4212531163079. The reversal of 4212531163043 is 3403611352124.
It is an interprime number because it is at equal distance from previous prime (4212531163007) and next prime (4212531163079).
It is not a de Polignac number, because 4212531163043 - 212 = 4212531158947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4212531162994 and 4212531163012.
It is not an unprimeable number, because it can be changed into a prime (4212531163003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35461313 + ... + 35579906.
It is an arithmetic number, because the mean of its divisors is an integer number (309455554320).
Almost surely, 24212531163043 is an apocalyptic number.
4212531163043 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
4212531163043 is a deficient number, since it is larger than the sum of its proper divisors (738757706077).
4212531163043 is a wasteful number, since it uses less digits than its factorization.
4212531163043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71041466.
The product of its (nonzero) digits is 51840, while the sum is 35.
The spelling of 4212531163043 in words is "four trillion, two hundred twelve billion, five hundred thirty-one million, one hundred sixty-three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •