Base | Representation |
---|---|
bin | 10010101100101011110… |
… | …10110100111011111001 |
3 | 2021102022111220112011022 |
4 | 21112111322310323321 |
5 | 41011232112302330 |
6 | 1211051114112225 |
7 | 64262614254155 |
oct | 11262572647371 |
9 | 2242274815138 |
10 | 642465353465 |
11 | 228516a41141 |
12 | a462041b675 |
13 | 487796cb2b0 |
14 | 2314a044065 |
15 | 11aa2ed9ae5 |
hex | 9595eb4ef9 |
642465353465 has 8 divisors (see below), whose sum is σ = 830262918408. Its totient is φ = 474435953280.
The previous prime is 642465353443. The next prime is 642465353479. The reversal of 642465353465 is 564353564246.
It can be written as a sum of positive squares in 4 ways, for example, as 79557279481 + 562908073984 = 282059^2 + 750272^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 642465353465 - 28 = 642465353209 is a prime.
It is a super-3 number, since 3×6424653534653 (a number of 36 digits) contains 333 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4942041116 + ... + 4942041245.
It is an arithmetic number, because the mean of its divisors is an integer number (103782864801).
Almost surely, 2642465353465 is an apocalyptic number.
642465353465 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
642465353465 is a deficient number, since it is larger than the sum of its proper divisors (187797564943).
642465353465 is a wasteful number, since it uses less digits than its factorization.
642465353465 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9884082379.
The product of its digits is 31104000, while the sum is 53.
The spelling of 642465353465 in words is "six hundred forty-two billion, four hundred sixty-five million, three hundred fifty-three thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •