Base | Representation |
---|---|
bin | 111101111010010110011… |
… | …111011011001010000101 |
3 | 120001201201101012120121021 |
4 | 331322112133123022011 |
5 | 1024201300331140031 |
6 | 13014302041551141 |
7 | 616244346035254 |
oct | 75722637331205 |
9 | 16051641176537 |
10 | 4254542443141 |
11 | 13a0383325661 |
12 | 5886857a54b1 |
13 | 24b280ca19b3 |
14 | 109cc714879b |
15 | 75a0c998511 |
hex | 3de967db285 |
4254542443141 has 2 divisors, whose sum is σ = 4254542443142. Its totient is φ = 4254542443140.
The previous prime is 4254542443111. The next prime is 4254542443181. The reversal of 4254542443141 is 1413442454524.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3370840920225 + 883701522916 = 1835985^2 + 940054^2 .
It is a cyclic number.
It is not a de Polignac number, because 4254542443141 - 27 = 4254542443013 is a prime.
It is a super-2 number, since 2×42545424431412 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4254542443111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2127271221570 + 2127271221571.
It is an arithmetic number, because the mean of its divisors is an integer number (2127271221571).
Almost surely, 24254542443141 is an apocalyptic number.
It is an amenable number.
4254542443141 is a deficient number, since it is larger than the sum of its proper divisors (1).
4254542443141 is an equidigital number, since it uses as much as digits as its factorization.
4254542443141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1228800, while the sum is 43.
Adding to 4254542443141 its reverse (1413442454524), we get a palindrome (5667984897665).
The spelling of 4254542443141 in words is "four trillion, two hundred fifty-four billion, five hundred forty-two million, four hundred forty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •