Base | Representation |
---|---|
bin | 10011000110011001101101… |
… | …10010101101101010101101 |
3 | 12111201021222002111101112211 |
4 | 21203030312302231222231 |
5 | 21001122334014422001 |
6 | 225155102343330421 |
7 | 11563333646144425 |
oct | 1143146662555255 |
9 | 174637862441484 |
10 | 42001404451501 |
11 | 12423771925080 |
12 | 48641a1450a11 |
13 | 1a5893baa8811 |
14 | a52c436b9485 |
15 | 4cc84616d351 |
hex | 263336cadaad |
42001404451501 has 8 divisors (see below), whose sum is σ = 45826061133600. Its totient is φ = 38177805633840.
The previous prime is 42001404451493. The next prime is 42001404451553. The reversal of 42001404451501 is 10515440410024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 42001404451501 - 23 = 42001404451493 is a prime.
It is a super-2 number, since 2×420014044515012 (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 (42001407451501) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 264383086 + ... + 264541903.
It is an arithmetic number, because the mean of its divisors is an integer number (5728257641700).
Almost surely, 242001404451501 is an apocalyptic number.
It is an amenable number.
42001404451501 is a deficient number, since it is larger than the sum of its proper divisors (3824656682099).
42001404451501 is a wasteful number, since it uses less digits than its factorization.
42001404451501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528932219.
The product of its (nonzero) digits is 12800, while the sum is 31.
Adding to 42001404451501 its reverse (10515440410024), we get a palindrome (52516844861525).
The spelling of 42001404451501 in words is "forty-two trillion, one billion, four hundred four million, four hundred fifty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •