Base | Representation |
---|---|
bin | 100001111010000101011… |
… | …101110000010010101111 |
3 | 22020202102110202201201011 |
4 | 201322011131300102233 |
5 | 301134032012203033 |
6 | 4542234410530051 |
7 | 330226222324330 |
oct | 41720535602257 |
9 | 8222373681634 |
10 | 2330111444143 |
11 | 81921618980a |
12 | 317711736927 |
13 | 13b961877842 |
14 | 80ac6b6a287 |
15 | 40928e7accd |
hex | 21e857704af |
2330111444143 has 8 divisors (see below), whose sum is σ = 2663068917888. Its totient is φ = 1997175072984.
The previous prime is 2330111444117. The next prime is 2330111444159. The reversal of 2330111444143 is 3414441110332.
2330111444143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2330111444143 - 217 = 2330111313071 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2330111442143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5038321 + ... + 5481322.
It is an arithmetic number, because the mean of its divisors is an integer number (332883614736).
Almost surely, 22330111444143 is an apocalyptic number.
2330111444143 is a deficient number, since it is larger than the sum of its proper divisors (332957473745).
2330111444143 is a wasteful number, since it uses less digits than its factorization.
2330111444143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10551293.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 2330111444143 its reverse (3414441110332), we get a palindrome (5744552554475).
The spelling of 2330111444143 in words is "two trillion, three hundred thirty billion, one hundred eleven million, four hundred forty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •