Base | Representation |
---|---|
bin | 1001101010011101001101110… |
… | …0011101111100101001010001 |
3 | 10022011200101010012211001000100 |
4 | 2122213103130131330221101 |
5 | 1203112110201324310001 |
6 | 10410123422302043013 |
7 | 263142246262100352 |
oct | 23247233435745121 |
9 | 3264611105731010 |
10 | 680000101010001 |
11 | 18773a4724aa422 |
12 | 643246a9b79469 |
13 | 23257971577275 |
14 | bdcc2753d7d29 |
15 | 539356a90a586 |
hex | 26a74dc77ca51 |
680000101010001 has 24 divisors (see below), whose sum is σ = 994400463416360. Its totient is φ = 447739316534016.
The previous prime is 680000101009993. The next prime is 680000101010003. The reversal of 680000101010001 is 100010101000086.
It can be written as a sum of positive squares in 4 ways, for example, as 53749425960000 + 626250675050001 = 7331400^2 + 25025001^2 .
It is not a de Polignac number, because 680000101010001 - 23 = 680000101009993 is a prime.
It is a super-2 number, since 2×6800001010100012 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (680000101010003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1106993806 + ... + 1107607911.
Almost surely, 2680000101010001 is an apocalyptic number.
It is an amenable number.
680000101010001 is a deficient number, since it is larger than the sum of its proper divisors (314400362406359).
680000101010001 is a wasteful number, since it uses less digits than its factorization.
680000101010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2214602145 (or 2214602142 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 680000101010001 its reverse (100010101000086), we get a palindrome (780010202010087).
The spelling of 680000101010001 in words is "six hundred eighty trillion, one hundred one million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •