Base | Representation |
---|---|
bin | 1100100001001001010… |
… | …11111000010010101101 |
3 | 1112010012021000020111011 |
4 | 12100210223320102231 |
5 | 24021332211242031 |
6 | 525331341225221 |
7 | 43034403323653 |
oct | 6204453702255 |
9 | 1463167006434 |
10 | 430112212141 |
11 | 156456149037 |
12 | 6b437862211 |
13 | 31737031651 |
14 | 16b6349add3 |
15 | b2c52da6b1 |
hex | 6424af84ad |
430112212141 has 4 divisors (see below), whose sum is σ = 430113532384. Its totient is φ = 430110891900.
The previous prime is 430112212111. The next prime is 430112212147. The reversal of 430112212141 is 141212211034.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 430112212141 - 213 = 430112203949 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 (430112212147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 217336 + ... + 952606.
It is an arithmetic number, because the mean of its divisors is an integer number (107528383096).
Almost surely, 2430112212141 is an apocalyptic number.
It is an amenable number.
430112212141 is a deficient number, since it is larger than the sum of its proper divisors (1320243).
430112212141 is an equidigital number, since it uses as much as digits as its factorization.
430112212141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1320242.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 430112212141 its reverse (141212211034), we get a palindrome (571324423175).
The spelling of 430112212141 in words is "four hundred thirty billion, one hundred twelve million, two hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •