Base | Representation |
---|---|
bin | 10011110010111000110… |
… | …00000000011111111101 |
3 | 2102000121010221011011110 |
4 | 21321130120000133331 |
5 | 42120424041131031 |
6 | 1240243030112233 |
7 | 100065602652240 |
oct | 11713430003775 |
9 | 2360533834143 |
10 | 680154630141 |
11 | 2424a7614588 |
12 | ab99a4ab679 |
13 | 4c1a4b2283c |
14 | 24cc3791257 |
15 | 12a5bbd2c46 |
hex | 9e5c6007fd |
680154630141 has 16 divisors (see below), whose sum is σ = 1036512350208. Its totient is φ = 388627446000.
The previous prime is 680154630131. The next prime is 680154630151. The reversal of 680154630141 is 141036451086.
It is an interprime number because it is at equal distance from previous prime (680154630131) and next prime (680154630151).
It is not a de Polignac number, because 680154630141 - 211 = 680154628093 is a prime.
It is a super-2 number, since 2×6801546301412 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 680154630141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (680154630121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1088085 + ... + 1595066.
It is an arithmetic number, because the mean of its divisors is an integer number (64782021888).
Almost surely, 2680154630141 is an apocalyptic number.
It is an amenable number.
680154630141 is a deficient number, since it is larger than the sum of its proper divisors (356357720067).
680154630141 is a wasteful number, since it uses less digits than its factorization.
680154630141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2695232.
The product of its (nonzero) digits is 69120, while the sum is 39.
The spelling of 680154630141 in words is "six hundred eighty billion, one hundred fifty-four million, six hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •