Base | Representation |
---|---|
bin | 1100101000101001101… |
… | …10001000000101111101 |
3 | 1112111121001200201111110 |
4 | 12110110312020011331 |
5 | 24103110201231031 |
6 | 531235233312233 |
7 | 43236300161136 |
oct | 6242466100575 |
9 | 1474531621443 |
10 | 434141430141 |
11 | 158133579171 |
12 | 70181105679 |
13 | 31c29a13103 |
14 | 17026658c8d |
15 | b45ddd2c46 |
hex | 6514d8817d |
434141430141 has 8 divisors (see below), whose sum is σ = 579291458944. Its totient is φ = 289209510720.
The previous prime is 434141430113. The next prime is 434141430143. The reversal of 434141430141 is 141034141434.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 434141430141 - 27 = 434141430013 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 434141430099 and 434141430108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (434141430143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54522700 + ... + 54530661.
It is an arithmetic number, because the mean of its divisors is an integer number (72411432368).
Almost surely, 2434141430141 is an apocalyptic number.
It is an amenable number.
434141430141 is a deficient number, since it is larger than the sum of its proper divisors (145150028803).
434141430141 is a wasteful number, since it uses less digits than its factorization.
434141430141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109054691.
The product of its (nonzero) digits is 9216, while the sum is 30.
Adding to 434141430141 its reverse (141034141434), we get a palindrome (575175571575).
The spelling of 434141430141 in words is "four hundred thirty-four billion, one hundred forty-one million, four hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •