Base | Representation |
---|---|
bin | 10011000111100010001010… |
… | …01110000101010011110111 |
3 | 12111212000100212121121020002 |
4 | 21203301011032011103313 |
5 | 21002242014102303134 |
6 | 225225014152101515 |
7 | 11566211566153262 |
oct | 1143610516052367 |
9 | 174760325547202 |
10 | 42040301212919 |
11 | 12439212056699 |
12 | 486b83799489b |
13 | 1a5c4ca415289 |
14 | a54a93543cd9 |
15 | 4cd870d7e87e |
hex | 263c453854f7 |
42040301212919 has 2 divisors, whose sum is σ = 42040301212920. Its totient is φ = 42040301212918.
The previous prime is 42040301212913. The next prime is 42040301212939. The reversal of 42040301212919 is 91921210304024.
42040301212919 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42040301212919 is a prime.
It is a super-2 number, since 2×420403012129192 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42040301212913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21020150606459 + 21020150606460.
It is an arithmetic number, because the mean of its divisors is an integer number (21020150606460).
Almost surely, 242040301212919 is an apocalyptic number.
42040301212919 is a deficient number, since it is larger than the sum of its proper divisors (1).
42040301212919 is an equidigital number, since it uses as much as digits as its factorization.
42040301212919 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 38.
The spelling of 42040301212919 in words is "forty-two trillion, forty billion, three hundred one million, two hundred twelve thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •