Base | Representation |
---|---|
bin | 11110111001001101111… |
… | …110110000101010111111 |
3 | 21111221220001201012010000 |
4 | 132321031332300222333 |
5 | 234240422132022033 |
6 | 4303145232245343 |
7 | 306245316313350 |
oct | 36711576605277 |
9 | 7457801635100 |
10 | 2123022142143 |
11 | 74940671a041 |
12 | 2a35579a0853 |
13 | 12527a8b6416 |
14 | 74a7d323d27 |
15 | 3a35844ca13 |
hex | 1ee4dfb0abf |
2123022142143 has 40 divisors (see below), whose sum is σ = 3627234327200. Its totient is φ = 1212236720640.
The previous prime is 2123022142103. The next prime is 2123022142147. The reversal of 2123022142143 is 3412412203212.
2123022142143 is a `hidden beast` number, since 2 + 1 + 2 + 302 + 214 + 2 + 143 = 666.
It is not a de Polignac number, because 2123022142143 - 28 = 2123022141887 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2123022142147) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 668218 + ... + 2166231.
It is an arithmetic number, because the mean of its divisors is an integer number (90680858180).
Almost surely, 22123022142143 is an apocalyptic number.
2123022142143 is a deficient number, since it is larger than the sum of its proper divisors (1504212185057).
2123022142143 is a wasteful number, since it uses less digits than its factorization.
2123022142143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2835789 (or 2835780 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 2123022142143 its reverse (3412412203212), we get a palindrome (5535434345355).
The spelling of 2123022142143 in words is "two trillion, one hundred twenty-three billion, twenty-two million, one hundred forty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •