Base | Representation |
---|---|
bin | 111111101110111111… |
… | …011000000100010101 |
3 | 20112122021211111120212 |
4 | 333232333120010111 |
5 | 2110123112204001 |
6 | 51234352135205 |
7 | 4641601153664 |
oct | 775677300425 |
9 | 215567744525 |
10 | 68434100501 |
11 | 270282a1658 |
12 | 1131a537505 |
13 | 65b7bc10c0 |
14 | 3452a7addb |
15 | 1ba7dea7bb |
hex | feefd8115 |
68434100501 has 8 divisors (see below), whose sum is σ = 76239581880. Its totient is φ = 60991664832.
The previous prime is 68434100489. The next prime is 68434100507. The reversal of 68434100501 is 10500143486.
It can be written as a sum of positive squares in 4 ways, for example, as 5646771025 + 62787329476 = 75145^2 + 250574^2 .
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 68434100501 - 230 = 67360358677 is a prime.
It is a super-2 number, since 2×684341005012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68434100507) 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, 90761030 + ... + 90761783.
It is an arithmetic number, because the mean of its divisors is an integer number (9529947735).
Almost surely, 268434100501 is an apocalyptic number.
It is an amenable number.
68434100501 is a deficient number, since it is larger than the sum of its proper divisors (7805481379).
68434100501 is a wasteful number, since it uses less digits than its factorization.
68434100501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181522855.
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 68434100501 its reverse (10500143486), we get a palindrome (78934243987).
The spelling of 68434100501 in words is "sixty-eight billion, four hundred thirty-four million, one hundred thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •