Base | Representation |
---|---|
bin | 110000010011001010101110… |
… | …101011011000010111010111 |
3 | 1000212010110222121000222111102 |
4 | 300103022232223120113113 |
5 | 210320321132310230033 |
6 | 2031441550130500315 |
7 | 62513041310511125 |
oct | 6023125653302727 |
9 | 1025113877028442 |
10 | 212423423133143 |
11 | 617592a4545122 |
12 | 1b9a90ba73469b |
13 | 916b59ac29aa1 |
14 | 3a654c455a915 |
15 | 1985949deade8 |
hex | c132aead85d7 |
212423423133143 has 16 divisors (see below), whose sum is σ = 213477686868096. Its totient is φ = 211371728087520.
The previous prime is 212423423133113. The next prime is 212423423133203. The reversal of 212423423133143 is 341331324324212.
It is a cyclic number.
It is not a de Polignac number, because 212423423133143 - 26 = 212423423133079 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212423423133097 and 212423423133106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212423423133113) 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, 1827350180 + ... + 1827466422.
It is an arithmetic number, because the mean of its divisors is an integer number (13342355429256).
Almost surely, 2212423423133143 is an apocalyptic number.
212423423133143 is a deficient number, since it is larger than the sum of its proper divisors (1054263734953).
212423423133143 is a wasteful number, since it uses less digits than its factorization.
212423423133143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127214.
The product of its digits is 248832, while the sum is 38.
Adding to 212423423133143 its reverse (341331324324212), we get a palindrome (553754747457355).
The spelling of 212423423133143 in words is "two hundred twelve trillion, four hundred twenty-three billion, four hundred twenty-three million, one hundred thirty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.504 sec. • engine limits •