Base | Representation |
---|---|
bin | 10011001010100011110010… |
… | …10010100000000001100111 |
3 | 12112012221200112010101200210 |
4 | 21211101321102200001213 |
5 | 21010442413011020010 |
6 | 225344445241110503 |
7 | 11606551621243110 |
oct | 1145217122400147 |
9 | 175187615111623 |
10 | 42144254001255 |
11 | 1247930675a10a |
12 | 4887a09488433 |
13 | 1a69255b26213 |
14 | a59b15549207 |
15 | 4d1407115b20 |
hex | 2654794a0067 |
42144254001255 has 64 divisors (see below), whose sum is σ = 81739002470400. Its totient is φ = 18112619640960.
The previous prime is 42144254001211. The next prime is 42144254001259. The reversal of 42144254001255 is 55210045244124.
It is not a de Polignac number, because 42144254001255 - 27 = 42144254001127 is a prime.
It is a super-2 number, since 2×421442540012552 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42144254001259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 80368195 + ... + 80890884.
It is an arithmetic number, because the mean of its divisors is an integer number (1277171913600).
Almost surely, 242144254001255 is an apocalyptic number.
42144254001255 is a deficient number, since it is larger than the sum of its proper divisors (39594748469145).
42144254001255 is a wasteful number, since it uses less digits than its factorization.
42144254001255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161259244.
The product of its (nonzero) digits is 256000, while the sum is 39.
Adding to 42144254001255 its reverse (55210045244124), we get a palindrome (97354299245379).
The spelling of 42144254001255 in words is "forty-two trillion, one hundred forty-four billion, two hundred fifty-four million, one thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •