Base | Representation |
---|---|
bin | 100111011010010000… |
… | …110111101010001011 |
3 | 11001020010002000211100 |
4 | 213122100313222023 |
5 | 1143131014423120 |
6 | 31235010432443 |
7 | 3025433556030 |
oct | 473220675213 |
9 | 131203060740 |
10 | 42316561035 |
11 | 16a456606a1 |
12 | 824b892723 |
13 | 3cb4ca5738 |
14 | 209610b387 |
15 | 117a07a490 |
hex | 9da437a8b |
42316561035 has 24 divisors (see below), whose sum is σ = 83827092960. Its totient is φ = 19344713472.
The previous prime is 42316561031. The next prime is 42316561057. The reversal of 42316561035 is 53016561324.
42316561035 is a `hidden beast` number, since 4 + 2 + 3 + 1 + 6 + 5 + 610 + 35 = 666.
It is not a de Polignac number, because 42316561035 - 22 = 42316561031 is a prime.
It is not an unprimeable number, because it can be changed into a prime (42316561031) 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 23 ways as a sum of consecutive naturals, for example, 67168830 + ... + 67169459.
It is an arithmetic number, because the mean of its divisors is an integer number (3492795540).
Almost surely, 242316561035 is an apocalyptic number.
42316561035 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
42316561035 is a deficient number, since it is larger than the sum of its proper divisors (41510531925).
42316561035 is a wasteful number, since it uses less digits than its factorization.
42316561035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134338307 (or 134338304 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
It can be divided in two parts, 42316 and 561035, that added together give a triangular number (603351 = T1098).
The spelling of 42316561035 in words is "forty-two billion, three hundred sixteen million, five hundred sixty-one thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •