Base | Representation |
---|---|
bin | 100111010101001010… |
… | …100001111101010011 |
3 | 11001000011002202021010 |
4 | 213111022201331103 |
5 | 1142442114410303 |
6 | 31222313102003 |
7 | 3023344455321 |
oct | 472512417523 |
9 | 131004082233 |
10 | 42231013203 |
11 | 16a01340305 |
12 | 82270b7903 |
13 | 3ca0352112 |
14 | 20889dcd11 |
15 | 11727ccc03 |
hex | 9d52a1f53 |
42231013203 has 4 divisors (see below), whose sum is σ = 56308017608. Its totient is φ = 28154008800.
The previous prime is 42231013193. The next prime is 42231013217. The reversal of 42231013203 is 30231013224.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-42231013203 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 42231013203.
It is not an unprimeable number, because it can be changed into a prime (42231013003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7038502198 + ... + 7038502203.
It is an arithmetic number, because the mean of its divisors is an integer number (14077004402).
Almost surely, 242231013203 is an apocalyptic number.
42231013203 is a deficient number, since it is larger than the sum of its proper divisors (14077004405).
42231013203 is a wasteful number, since it uses less digits than its factorization.
42231013203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14077004404.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 42231013203 its sum of digits (21), we get a palindrome (42231013224).
Adding to 42231013203 its reverse (30231013224), we get a palindrome (72462026427).
The spelling of 42231013203 in words is "forty-two billion, two hundred thirty-one million, thirteen thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •