Base | Representation |
---|---|
bin | 110001010110001001011010… |
… | …0010100101001101001111101 |
3 | 2002220212000011110120222201220 |
4 | 1202230102310110221221331 |
5 | 423343003324040334031 |
6 | 4135052532404023553 |
7 | 160266152415146634 |
oct | 14254226424515175 |
9 | 2086760143528656 |
10 | 434052420246141 |
11 | 116336663562094 |
12 | 40822325391bb9 |
13 | 15826c76a7c548 |
14 | 792836bc7451b |
15 | 352aa75e7c596 |
hex | 18ac4b4529a7d |
434052420246141 has 16 divisors (see below), whose sum is σ = 582007893331968. Its totient is φ = 287733870426800.
The previous prime is 434052420246061. The next prime is 434052420246163. The reversal of 434052420246141 is 141642024250434.
It is a cyclic number.
It is not a de Polignac number, because 434052420246141 - 218 = 434052419983997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 434052420246093 and 434052420246102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (434052420246541) 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, 155712771 + ... + 158475776.
It is an arithmetic number, because the mean of its divisors is an integer number (36375493333248).
Almost surely, 2434052420246141 is an apocalyptic number.
It is an amenable number.
434052420246141 is a deficient number, since it is larger than the sum of its proper divisors (147955473085827).
434052420246141 is a wasteful number, since it uses less digits than its factorization.
434052420246141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 314191152.
The product of its (nonzero) digits is 737280, while the sum is 42.
Adding to 434052420246141 its reverse (141642024250434), we get a palindrome (575694444496575).
The spelling of 434052420246141 in words is "four hundred thirty-four trillion, fifty-two billion, four hundred twenty million, two hundred forty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •