Base | Representation |
---|---|
bin | 100111010101001011… |
… | …010010110010001001 |
3 | 11001000011110220121011 |
4 | 213111023102302021 |
5 | 1142442142310233 |
6 | 31222321243521 |
7 | 3023346250351 |
oct | 472513226211 |
9 | 131004426534 |
10 | 42231213193 |
11 | 16a01467594 |
12 | 82271935a1 |
13 | 3ca03c2160 |
14 | 2088a51b61 |
15 | 117281c0cd |
hex | 9d52d2c89 |
42231213193 has 4 divisors (see below), whose sum is σ = 45479768068. Its totient is φ = 38982658320.
The previous prime is 42231213173. The next prime is 42231213209. The reversal of 42231213193 is 39131213224.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 17427168144 + 24804045049 = 132012^2 + 157493^2 .
It is a cyclic number.
It is not a de Polignac number, because 42231213193 - 25 = 42231213161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42231213133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1624277418 + ... + 1624277443.
It is an arithmetic number, because the mean of its divisors is an integer number (11369942017).
Almost surely, 242231213193 is an apocalyptic number.
It is an amenable number.
42231213193 is a deficient number, since it is larger than the sum of its proper divisors (3248554875).
42231213193 is a wasteful number, since it uses less digits than its factorization.
42231213193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3248554874.
The product of its digits is 7776, while the sum is 31.
Adding to 42231213193 its sum of digits (31), we get a palindrome (42231213224).
The spelling of 42231213193 in words is "forty-two billion, two hundred thirty-one million, two hundred thirteen thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •