Base | Representation |
---|---|
bin | 111111110110001… |
… | …1101110110110111 |
3 | 12112022020022122010 |
4 | 1333230131312313 |
5 | 13341421104223 |
6 | 552330135303 |
7 | 104042533311 |
oct | 17754356667 |
9 | 5468208563 |
10 | 2142363063 |
11 | 9aa343095 |
12 | 4b9581533 |
13 | 281b01169 |
14 | 1647567b1 |
15 | c8134393 |
hex | 7fb1ddb7 |
2142363063 has 8 divisors (see below), whose sum is σ = 2882690800. Its totient is φ = 1415138688.
The previous prime is 2142363059. The next prime is 2142363109. The reversal of 2142363063 is 3603632412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2142363063 - 22 = 2142363059 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2142363063.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2142363863) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3275458 + ... + 3276111.
It is an arithmetic number, because the mean of its divisors is an integer number (360336350).
Almost surely, 22142363063 is an apocalyptic number.
2142363063 is a deficient number, since it is larger than the sum of its proper divisors (740327737).
2142363063 is a wasteful number, since it uses less digits than its factorization.
2142363063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6551681.
The product of its (nonzero) digits is 15552, while the sum is 30.
The square root of 2142363063 is about 46285.6680085747. The cubic root of 2142363063 is about 1289.1328954417.
Adding to 2142363063 its reverse (3603632412), we get a palindrome (5745995475).
The spelling of 2142363063 in words is "two billion, one hundred forty-two million, three hundred sixty-three thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •