Base | Representation |
---|---|
bin | 100111100101110100… |
… | …000001010110010111 |
3 | 11001201121200021012210 |
4 | 213211310001112113 |
5 | 1144030120401033 |
6 | 31310131444503 |
7 | 3033305541666 |
oct | 474564012627 |
9 | 131647607183 |
10 | 42510325143 |
11 | 17034a74520 |
12 | 82a4756733 |
13 | 4016188560 |
14 | 20b3b48ddd |
15 | 118c0a1d63 |
hex | 9e5d01597 |
42510325143 has 16 divisors (see below), whose sum is σ = 66589600896. Its totient is φ = 23781999840.
The previous prime is 42510325139. The next prime is 42510325181. The reversal of 42510325143 is 34152301524.
42510325143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42510325143 - 22 = 42510325139 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 42510325143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42510325043) 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, 49545405 + ... + 49546262.
It is an arithmetic number, because the mean of its divisors is an integer number (4161850056).
Almost surely, 242510325143 is an apocalyptic number.
42510325143 is a deficient number, since it is larger than the sum of its proper divisors (24079275753).
42510325143 is a wasteful number, since it uses less digits than its factorization.
42510325143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99091694.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 42510325143 its reverse (34152301524), we get a palindrome (76662626667).
It can be divided in two parts, 42510 and 325143, that added together give a triangular number (367653 = T857).
The spelling of 42510325143 in words is "forty-two billion, five hundred ten million, three hundred twenty-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •