Base | Representation |
---|---|
bin | 1100101000101000011… |
… | …11001011011010101101 |
3 | 1112111120100111000000022 |
4 | 12110110033023122231 |
5 | 24103100043021031 |
6 | 531234230411525 |
7 | 43236114325313 |
oct | 6242417133255 |
9 | 1474510430008 |
10 | 434131220141 |
11 | 158128835253 |
12 | 70179800ba5 |
13 | 31c27879aa8 |
14 | 1702515c0b3 |
15 | b45d06797b |
hex | 65143cb6ad |
434131220141 has 16 divisors (see below), whose sum is σ = 455137911360. Its totient is φ = 413709878400.
The previous prime is 434131220129. The next prime is 434131220209. The reversal of 434131220141 is 141022131434.
It is a cyclic number.
It is not a de Polignac number, because 434131220141 - 214 = 434131203757 is a prime.
It is a super-2 number, since 2×4341312201412 (a number of 24 digits) contains 22 as substring.
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 434131220141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (434131220101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 124160 + ... + 940041.
It is an arithmetic number, because the mean of its divisors is an integer number (28446119460).
Almost surely, 2434131220141 is an apocalyptic number.
It is an amenable number.
434131220141 is a deficient number, since it is larger than the sum of its proper divisors (21006691219).
434131220141 is a wasteful number, since it uses less digits than its factorization.
434131220141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1064476.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 434131220141 its reverse (141022131434), we get a palindrome (575153351575).
The spelling of 434131220141 in words is "four hundred thirty-four billion, one hundred thirty-one million, two hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •