Base | Representation |
---|---|
bin | 1100100101000010100… |
… | …01011110010101110101 |
3 | 1112022120221010220221121 |
4 | 12102201101132111311 |
5 | 24040122311121401 |
6 | 530315010143541 |
7 | 43140244066603 |
oct | 6224121362565 |
9 | 1468527126847 |
10 | 432202442101 |
11 | 157329013811 |
12 | 6b91b881bb1 |
13 | 319ab0ab501 |
14 | 16cc0d22873 |
15 | b398a72ca1 |
hex | 64a145e575 |
432202442101 has 4 divisors (see below), whose sum is σ = 434465282304. Its totient is φ = 429939601900.
The previous prime is 432202442083. The next prime is 432202442117. The reversal of 432202442101 is 101244202234.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 432202442101 - 29 = 432202441589 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 (432202442701) 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, 1131419815 + ... + 1131420196.
It is an arithmetic number, because the mean of its divisors is an integer number (108616320576).
Almost surely, 2432202442101 is an apocalyptic number.
It is an amenable number.
432202442101 is a deficient number, since it is larger than the sum of its proper divisors (2262840203).
432202442101 is a wasteful number, since it uses less digits than its factorization.
432202442101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2262840202.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 432202442101 its reverse (101244202234), we get a palindrome (533446644335).
The spelling of 432202442101 in words is "four hundred thirty-two billion, two hundred two million, four hundred forty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •