Base | Representation |
---|---|
bin | 1011111101110100… |
… | …1101000111001111 |
3 | 22021212010210112010 |
4 | 2333131031013033 |
5 | 23034244313033 |
6 | 1250422312303 |
7 | 142412302053 |
oct | 27735150717 |
9 | 8255123463 |
10 | 3212104143 |
11 | 13a9170426 |
12 | 757888693 |
13 | 3c2619051 |
14 | 226859c63 |
15 | 13bede863 |
hex | bf74d1cf |
3212104143 has 4 divisors (see below), whose sum is σ = 4282805528. Its totient is φ = 2141402760.
The previous prime is 3212104141. The next prime is 3212104183. The reversal of 3212104143 is 3414012123.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3414012123 = 3 ⋅1138004041.
It is not a de Polignac number, because 3212104143 - 21 = 3212104141 is a prime.
It is a super-2 number, since 2×32121041432 = 20635226050955528898, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3212104141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 535350688 + ... + 535350693.
It is an arithmetic number, because the mean of its divisors is an integer number (1070701382).
Almost surely, 23212104143 is an apocalyptic number.
3212104143 is a deficient number, since it is larger than the sum of its proper divisors (1070701385).
3212104143 is a wasteful number, since it uses less digits than its factorization.
3212104143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1070701384.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 3212104143 is about 56675.4280354370. The cubic root of 3212104143 is about 1475.4682635448.
Adding to 3212104143 its reverse (3414012123), we get a palindrome (6626116266).
The spelling of 3212104143 in words is "three billion, two hundred twelve million, one hundred four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •